TSTP Solution File: LAT286+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT286+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:46:23 EDT 2022
% Result : Theorem 0.98s 26.16s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 111 ( 6 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 120 ( 51 ~; 40 |; 17 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 42 ( 3 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t15_lopclset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p',t13_lopclset) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p',t4_lopclset) ).
fof(fc5_pre_topc,axiom,
! [X1] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> v4_pre_topc(k2_pre_topc(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',fc5_pre_topc) ).
fof(fc8_tops_1,axiom,
! [X1] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ( v3_pre_topc(k2_pre_topc(X1),X1)
& v4_pre_topc(k2_pre_topc(X1),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+207.ax',fc8_tops_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(d3_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k2_pre_topc(X1) = u1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',d3_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_l1_pre_topc) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(assume_negation,[status(cth)],[t15_lopclset]) ).
fof(c_0_11,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ m1_subset_1(k2_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_10])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| m1_subset_1(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_13,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| u1_struct_0(k6_lopclset(X2)) = k1_lopclset(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t13_lopclset])])]) ).
cnf(c_0_16,negated_conjecture,
~ r2_hidden(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(pm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| v3_struct_0(X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| ~ v3_pre_topc(X4,X3)
| ~ v4_pre_topc(X4,X3)
| r2_hidden(X4,k1_lopclset(X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t4_lopclset])])])])])]) ).
cnf(c_0_22,negated_conjecture,
~ r2_hidden(k2_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(pm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_23,plain,
( r2_hidden(X1,k1_lopclset(X2))
| v3_struct_0(X2)
| ~ v4_pre_topc(X1,X2)
| ~ v3_pre_topc(X1,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_24,plain,
! [X2] :
( ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| v4_pre_topc(k2_pre_topc(X2),X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_pre_topc])]) ).
cnf(c_0_25,negated_conjecture,
( ~ v3_pre_topc(k2_pre_topc(esk1_0),esk1_0)
| ~ v4_pre_topc(k2_pre_topc(esk1_0),esk1_0)
| ~ m1_subset_1(k2_pre_topc(esk1_0),k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22,c_0_23]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_26,plain,
( v4_pre_topc(k2_pre_topc(X1),X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_27,plain,
! [X2] :
( ( v3_pre_topc(k2_pre_topc(X2),X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2) )
& ( v4_pre_topc(k2_pre_topc(X2),X2)
| ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc8_tops_1])])]) ).
fof(c_0_28,plain,
! [X3,X4,X3,X4] :
( ( ~ m1_subset_1(X3,k1_zfmisc_1(X4))
| r1_tarski(X3,X4) )
& ( ~ r1_tarski(X3,X4)
| m1_subset_1(X3,k1_zfmisc_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_29,plain,
! [X3] : r1_tarski(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_30,negated_conjecture,
( ~ v3_pre_topc(k2_pre_topc(esk1_0),esk1_0)
| ~ m1_subset_1(k2_pre_topc(esk1_0),k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_26]),c_0_18]),c_0_19])]) ).
cnf(c_0_31,plain,
( v3_pre_topc(k2_pre_topc(X1),X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X2] :
( ~ l1_struct_0(X2)
| k2_pre_topc(X2) = u1_struct_0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
cnf(c_0_33,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_31]),c_0_18]),c_0_19])]) ).
cnf(c_0_36,plain,
( k2_pre_topc(X1) = u1_struct_0(X1)
| ~ l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(pm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_38,plain,
! [X2] :
( ~ l1_pre_topc(X2)
| l1_struct_0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
cnf(c_0_39,negated_conjecture,
~ l1_struct_0(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_40,plain,
( l1_struct_0(X1)
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_39,c_0_40]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT286+3 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 29 23:20:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.97/24.02 eprover: CPU time limit exceeded, terminating
% 0.97/24.02 eprover: CPU time limit exceeded, terminating
% 0.97/24.02 eprover: CPU time limit exceeded, terminating
% 0.97/24.03 eprover: CPU time limit exceeded, terminating
% 0.98/26.16 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.98/26.16
% 0.98/26.16 # Failure: Resource limit exceeded (time)
% 0.98/26.16 # OLD status Res
% 0.98/26.16 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.98/26.16 # Preprocessing time : 0.439 s
% 0.98/26.16 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.98/26.16 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.98/26.16 # Preprocessing time : 0.428 s
% 0.98/26.16
% 0.98/26.16 # Failure: Out of unprocessed clauses!
% 0.98/26.16 # OLD status GaveUp
% 0.98/26.16 # Parsed axioms : 12371
% 0.98/26.16 # Removed by relevancy pruning/SinE : 12342
% 0.98/26.16 # Initial clauses : 42
% 0.98/26.16 # Removed in clause preprocessing : 0
% 0.98/26.16 # Initial clauses in saturation : 42
% 0.98/26.16 # Processed clauses : 102
% 0.98/26.16 # ...of these trivial : 0
% 0.98/26.16 # ...subsumed : 29
% 0.98/26.16 # ...remaining for further processing : 73
% 0.98/26.16 # Other redundant clauses eliminated : 5
% 0.98/26.16 # Clauses deleted for lack of memory : 0
% 0.98/26.16 # Backward-subsumed : 0
% 0.98/26.16 # Backward-rewritten : 0
% 0.98/26.16 # Generated clauses : 67
% 0.98/26.16 # ...of the previous two non-trivial : 60
% 0.98/26.16 # Contextual simplify-reflections : 45
% 0.98/26.16 # Paramodulations : 54
% 0.98/26.16 # Factorizations : 0
% 0.98/26.16 # Equation resolutions : 13
% 0.98/26.16 # Current number of processed clauses : 72
% 0.98/26.16 # Positive orientable unit clauses : 4
% 0.98/26.16 # Positive unorientable unit clauses: 0
% 0.98/26.16 # Negative unit clauses : 2
% 0.98/26.16 # Non-unit-clauses : 66
% 0.98/26.16 # Current number of unprocessed clauses: 0
% 0.98/26.16 # ...number of literals in the above : 0
% 0.98/26.16 # Current number of archived formulas : 0
% 0.98/26.16 # Current number of archived clauses : 0
% 0.98/26.16 # Clause-clause subsumption calls (NU) : 4732
% 0.98/26.16 # Rec. Clause-clause subsumption calls : 134
% 0.98/26.16 # Non-unit clause-clause subsumptions : 74
% 0.98/26.16 # Unit Clause-clause subsumption calls : 1
% 0.98/26.16 # Rewrite failures with RHS unbound : 0
% 0.98/26.16 # BW rewrite match attempts : 0
% 0.98/26.16 # BW rewrite match successes : 0
% 0.98/26.16 # Condensation attempts : 0
% 0.98/26.16 # Condensation successes : 0
% 0.98/26.16 # Termbank termtop insertions : 300396
% 0.98/26.16
% 0.98/26.16 # -------------------------------------------------
% 0.98/26.16 # User time : 0.416 s
% 0.98/26.16 # System time : 0.022 s
% 0.98/26.16 # Total time : 0.438 s
% 0.98/26.16 # Maximum resident set size: 27720 pages
% 0.98/26.16 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.98/26.16 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.98/26.16 # Preprocessing time : 0.361 s
% 0.98/26.16
% 0.98/26.16 # Proof found!
% 0.98/26.16 # SZS status Theorem
% 0.98/26.16 # SZS output start CNFRefutation
% See solution above
% 0.98/26.16 # Proof object total steps : 42
% 0.98/26.16 # Proof object clause steps : 21
% 0.98/26.16 # Proof object formula steps : 21
% 0.98/26.16 # Proof object conjectures : 14
% 0.98/26.16 # Proof object clause conjectures : 11
% 0.98/26.16 # Proof object formula conjectures : 3
% 0.98/26.16 # Proof object initial clauses used : 13
% 0.98/26.16 # Proof object initial formulas used : 10
% 0.98/26.16 # Proof object generating inferences : 8
% 0.98/26.16 # Proof object simplifying inferences : 18
% 0.98/26.16 # Training examples: 0 positive, 0 negative
% 0.98/26.16 # Parsed axioms : 12371
% 0.98/26.16 # Removed by relevancy pruning/SinE : 11701
% 0.98/26.16 # Initial clauses : 1239
% 0.98/26.16 # Removed in clause preprocessing : 25
% 0.98/26.16 # Initial clauses in saturation : 1214
% 0.98/26.16 # Processed clauses : 1508
% 0.98/26.16 # ...of these trivial : 30
% 0.98/26.16 # ...subsumed : 237
% 0.98/26.16 # ...remaining for further processing : 1241
% 0.98/26.16 # Other redundant clauses eliminated : 102
% 0.98/26.16 # Clauses deleted for lack of memory : 0
% 0.98/26.16 # Backward-subsumed : 2
% 0.98/26.16 # Backward-rewritten : 9
% 0.98/26.16 # Generated clauses : 23526
% 0.98/26.16 # ...of the previous two non-trivial : 22187
% 0.98/26.16 # Contextual simplify-reflections : 133
% 0.98/26.16 # Paramodulations : 23363
% 0.98/26.16 # Factorizations : 19
% 0.98/26.16 # Equation resolutions : 145
% 0.98/26.16 # Current number of processed clauses : 1211
% 0.98/26.16 # Positive orientable unit clauses : 91
% 0.98/26.16 # Positive unorientable unit clauses: 3
% 0.98/26.16 # Negative unit clauses : 72
% 0.98/26.16 # Non-unit-clauses : 1045
% 0.98/26.16 # Current number of unprocessed clauses: 21730
% 0.98/26.16 # ...number of literals in the above : 112042
% 0.98/26.16 # Current number of archived formulas : 0
% 0.98/26.16 # Current number of archived clauses : 12
% 0.98/26.16 # Clause-clause subsumption calls (NU) : 499335
% 0.98/26.16 # Rec. Clause-clause subsumption calls : 90429
% 0.98/26.16 # Non-unit clause-clause subsumptions : 234
% 0.98/26.16 # Unit Clause-clause subsumption calls : 32073
% 0.98/26.16 # Rewrite failures with RHS unbound : 0
% 0.98/26.16 # BW rewrite match attempts : 195
% 0.98/26.16 # BW rewrite match successes : 32
% 0.98/26.16 # Condensation attempts : 0
% 0.98/26.16 # Condensation successes : 0
% 0.98/26.16 # Termbank termtop insertions : 707808
% 0.98/26.16
% 0.98/26.16 # -------------------------------------------------
% 0.98/26.16 # User time : 0.912 s
% 0.98/26.16 # System time : 0.027 s
% 0.98/26.16 # Total time : 0.939 s
% 0.98/26.16 # Maximum resident set size: 52824 pages
%------------------------------------------------------------------------------