TSTP Solution File: TOP025+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : TOP025+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : Thu Jul 21 21:25:28 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 123 ( 18 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 149 ( 56 ~; 54 |; 24 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_tsp_2,conjecture,
! [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) )
& v1_tsp_2(X2,X1)
& v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_tsp_2) ).
fof(d5_tsp_2,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)))
=> ( v1_tsp_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tsp_2) ).
fof(t62_tex_4,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)))
=> ( v4_pre_topc(X2,X1)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t62_tex_4) ).
fof(t58_tex_4,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)
=> k3_tex_4(X1,X2) = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t58_tex_4) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_tex_2) ).
fof(c_0_5,negated_conjecture,
~ ! [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) )
& v1_tsp_2(X2,X1)
& v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ) ),
inference(assume_negation,[status(cth)],[t3_tsp_2]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ( v1_tsp_1(X4,X3)
| ~ v1_tsp_2(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3) )
& ( k3_tex_4(X3,X4) = u1_struct_0(X3)
| ~ v1_tsp_2(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3) )
& ( ~ v1_tsp_1(X4,X3)
| k3_tex_4(X3,X4) != u1_struct_0(X3)
| v1_tsp_2(X4,X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3) ) ),
inference(distribute,[status(thm)],[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)],[d5_tsp_2])])])])])])]) ).
fof(c_0_7,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& ( v3_pre_topc(esk2_0,esk1_0)
| v4_pre_topc(esk2_0,esk1_0) )
& v1_tsp_2(esk2_0,esk1_0)
& v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(skolemize,[status(esa)],[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)],[c_0_5])])])])])]) ).
fof(c_0_8,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)))
| ~ v4_pre_topc(X4,X3)
| k3_tex_4(X3,X4) = X4 ),
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)],[t62_tex_4])])])])])]) ).
cnf(c_0_9,plain,
( v3_struct_0(X1)
| k3_tex_4(X1,X2) = u1_struct_0(X1)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,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)
| k3_tex_4(X3,X4) = X4 ),
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)],[t58_tex_4])])])])])]) ).
cnf(c_0_16,plain,
( k3_tex_4(X1,X2) = X2
| v3_struct_0(X1)
| ~ v4_pre_topc(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
k3_tex_4(esk1_0,esk2_0) = u1_struct_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_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( k3_tex_4(X1,X2) = X2
| v3_struct_0(X1)
| ~ v3_pre_topc(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ( ~ v1_tex_2(X4,k1_zfmisc_1(X3))
| X4 != X3
| ~ m1_subset_1(X4,k1_zfmisc_1(X3)) )
& ( X4 = X3
| v1_tex_2(X4,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X3)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_tex_2])])]) ).
cnf(c_0_20,negated_conjecture,
( u1_struct_0(esk1_0) = esk2_0
| ~ v4_pre_topc(esk2_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_16,c_0_17]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( v4_pre_topc(esk2_0,esk1_0)
| v3_pre_topc(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( u1_struct_0(esk1_0) = esk2_0
| ~ v3_pre_topc(esk2_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_18,c_0_17]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_23,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| X1 != X2
| ~ v1_tex_2(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
u1_struct_0(esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,plain,
( ~ v1_tex_2(X1,k1_zfmisc_1(X1))
| ~ m1_subset_1(X1,k1_zfmisc_1(X1)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
v1_tex_2(esk2_0,k1_zfmisc_1(esk2_0)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ m1_subset_1(esk2_0,k1_zfmisc_1(esk2_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_25]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : TOP025+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.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 : Sun May 29 04:16:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 61
% 0.22/1.40 # Removed by relevancy pruning/SinE : 47
% 0.22/1.40 # Initial clauses : 33
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 33
% 0.22/1.40 # Processed clauses : 41
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 4
% 0.22/1.40 # ...remaining for further processing : 37
% 0.22/1.40 # Other redundant clauses eliminated : 1
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 1
% 0.22/1.40 # Generated clauses : 13
% 0.22/1.40 # ...of the previous two non-trivial : 9
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 12
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 1
% 0.22/1.40 # Current number of processed clauses : 35
% 0.22/1.40 # Positive orientable unit clauses : 9
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 23
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 1
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 45
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 16
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 2
% 0.22/1.40 # Rewrite failures with RHS unbound : 10
% 0.22/1.40 # BW rewrite match attempts : 5
% 0.22/1.40 # BW rewrite match successes : 5
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2643
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.013 s
% 0.22/1.40 # System time : 0.006 s
% 0.22/1.40 # Total time : 0.018 s
% 0.22/1.40 # Maximum resident set size: 3052 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.019 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 30
% 0.22/1.40 # Proof object clause steps : 19
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 17
% 0.22/1.40 # Proof object clause conjectures : 14
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 11
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 5
% 0.22/1.40 # Proof object simplifying inferences : 20
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 61
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 146
% 0.22/1.40 # Removed in clause preprocessing : 8
% 0.22/1.40 # Initial clauses in saturation : 138
% 0.22/1.40 # Processed clauses : 183
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 9
% 0.22/1.40 # ...remaining for further processing : 173
% 0.22/1.40 # Other redundant clauses eliminated : 1
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 22
% 0.22/1.40 # Generated clauses : 528
% 0.22/1.40 # ...of the previous two non-trivial : 514
% 0.22/1.40 # Contextual simplify-reflections : 2
% 0.22/1.40 # Paramodulations : 527
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 1
% 0.22/1.40 # Current number of processed clauses : 150
% 0.22/1.40 # Positive orientable unit clauses : 24
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 7
% 0.22/1.40 # Non-unit-clauses : 119
% 0.22/1.40 # Current number of unprocessed clauses: 399
% 0.22/1.40 # ...number of literals in the above : 1515
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 22
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 5097
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1701
% 0.22/1.40 # Non-unit clause-clause subsumptions : 11
% 0.22/1.40 # Unit Clause-clause subsumption calls : 252
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 2
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 13545
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.029 s
% 0.22/1.40 # System time : 0.003 s
% 0.22/1.40 # Total time : 0.032 s
% 0.22/1.40 # Maximum resident set size: 3612 pages
%------------------------------------------------------------------------------