TSTP Solution File: LAT287+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT287+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 04:28:53 EDT 2022
% Result : Theorem 13.77s 4.28s
% Output : CNFRefutation 13.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 112 ( 7 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 126 ( 52 ~; 42 |; 20 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-1 aty)
% Number of variables : 35 ( 1 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_lopclset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_lopclset) ).
fof(d2_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k1_pre_topc(X1) = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',d2_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',dt_l1_pre_topc) ).
fof(t4_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( v3_pre_topc(X2,X1)
& v4_pre_topc(X2,X1) )
=> r2_hidden(X2,k1_lopclset(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_lopclset) ).
fof(t4_subset_1,axiom,
! [X1] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',t4_subset_1) ).
fof(cc1_tops_1,axiom,
! [X1] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_xboole_0(X2)
=> ( v3_pre_topc(X2,X1)
& v4_pre_topc(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+207.ax',cc1_tops_1) ).
fof(fc6_membered,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_membered(k1_xboole_0)
& v2_membered(k1_xboole_0)
& v3_membered(k1_xboole_0)
& v4_membered(k1_xboole_0)
& v5_membered(k1_xboole_0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+51.ax',fc6_membered) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(assume_negation,[status(cth)],[t16_lopclset]) ).
fof(c_0_10,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])]) ).
fof(c_0_11,plain,
! [X717,X718] :
( ~ r2_hidden(X717,X718)
| m1_subset_1(X717,X718) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_12,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X23] :
( v3_struct_0(X23)
| ~ v2_pre_topc(X23)
| ~ l1_pre_topc(X23)
| u1_struct_0(k6_lopclset(X23)) = k1_lopclset(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t13_lopclset])])]) ).
fof(c_0_15,plain,
! [X27] :
( ~ l1_struct_0(X27)
| k1_pre_topc(X27) = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_pre_topc])]) ).
fof(c_0_16,plain,
! [X593] :
( ~ l1_pre_topc(X593)
| l1_struct_0(X593) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
cnf(c_0_17,negated_conjecture,
~ r2_hidden(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( v3_struct_0(X1)
| u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( k1_pre_topc(X1) = k1_xboole_0
| ~ l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( l1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
~ r2_hidden(k1_pre_topc(esk1_0),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_25,plain,
( k1_pre_topc(X1) = k1_xboole_0
| ~ l1_pre_topc(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X349,X350] :
( v3_struct_0(X349)
| ~ v2_pre_topc(X349)
| ~ l1_pre_topc(X349)
| ~ m1_subset_1(X350,k1_zfmisc_1(u1_struct_0(X349)))
| ~ v3_pre_topc(X350,X349)
| ~ v4_pre_topc(X350,X349)
| r2_hidden(X350,k1_lopclset(X349)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t4_lopclset])])])]) ).
fof(c_0_27,plain,
! [X621] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X621)),
inference(variable_rename,[status(thm)],[t4_subset_1]) ).
cnf(c_0_28,negated_conjecture,
~ r2_hidden(k1_xboole_0,k1_lopclset(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20])]) ).
cnf(c_0_29,plain,
( v3_struct_0(X1)
| r2_hidden(X2,k1_lopclset(X1))
| ~ v2_pre_topc(X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_pre_topc(X2,X1)
| ~ v4_pre_topc(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_31,plain,
! [X801,X802] :
( ( v3_pre_topc(X802,X801)
| ~ v1_xboole_0(X802)
| ~ m1_subset_1(X802,k1_zfmisc_1(u1_struct_0(X801)))
| ~ v2_pre_topc(X801)
| ~ l1_pre_topc(X801) )
& ( v4_pre_topc(X802,X801)
| ~ v1_xboole_0(X802)
| ~ m1_subset_1(X802,k1_zfmisc_1(u1_struct_0(X801)))
| ~ v2_pre_topc(X801)
| ~ l1_pre_topc(X801) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_tops_1])])])]) ).
cnf(c_0_32,negated_conjecture,
( ~ v3_pre_topc(k1_xboole_0,esk1_0)
| ~ v4_pre_topc(k1_xboole_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_19]),c_0_20]),c_0_30])]),c_0_21]) ).
cnf(c_0_33,plain,
( v4_pre_topc(X1,X2)
| ~ v1_xboole_0(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_35,negated_conjecture,
~ v3_pre_topc(k1_xboole_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19]),c_0_20]),c_0_30]),c_0_34])]) ).
cnf(c_0_36,plain,
( v3_pre_topc(X1,X2)
| ~ v1_xboole_0(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_19]),c_0_20]),c_0_30]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LAT287+2 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 29 17:28:14 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected SinE mode:
% 0.44/0.65 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.65 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.44/0.65 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.44/0.65 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.77/4.28 # ENIGMATIC: Solved by autoschedule:
% 13.77/4.28 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 13.77/4.28 # Trying AutoSched0 for 150 seconds
% 13.77/4.28 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 13.77/4.28 # and selection function SelectMaxLComplexAvoidPosPred.
% 13.77/4.28 #
% 13.77/4.28 # Preprocessing time : 0.086 s
% 13.77/4.28
% 13.77/4.28 # Proof found!
% 13.77/4.28 # SZS status Theorem
% 13.77/4.28 # SZS output start CNFRefutation
% See solution above
% 13.77/4.28 # Training examples: 0 positive, 0 negative
% 13.77/4.28
% 13.77/4.28 # -------------------------------------------------
% 13.77/4.28 # User time : 0.536 s
% 13.77/4.28 # System time : 0.042 s
% 13.77/4.28 # Total time : 0.578 s
% 13.77/4.28 # Maximum resident set size: 14540 pages
% 13.77/4.28
%------------------------------------------------------------------------------