TSTP Solution File: TOP026+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : TOP026+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:29 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 80 ( 8 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 92 ( 35 ~; 27 |; 15 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 28 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_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)))
=> ( v1_tsp_2(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> k6_pre_topc(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k6_pre_topc(X1,X3))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_tsp_2) ).
fof(t5_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)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v4_pre_topc(X3,X1)
=> X3 = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,X3)) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_tsp_2) ).
fof(fc2_tops_1,axiom,
! [X1,X2] :
( ( v2_pre_topc(X1)
& l1_pre_topc(X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> v4_pre_topc(k6_pre_topc(X1,X2),X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc2_tops_1) ).
fof(dt_k6_pre_topc,axiom,
! [X1,X2] :
( ( l1_pre_topc(X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k6_pre_topc) ).
fof(c_0_4,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)))
=> ( v1_tsp_2(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> k6_pre_topc(X1,X3) = k3_tex_4(X1,k5_subset_1(u1_struct_0(X1),X2,k6_pre_topc(X1,X3))) ) ) ) ),
inference(assume_negation,[status(cth)],[t7_tsp_2]) ).
fof(c_0_5,plain,
! [X4,X5,X6] :
( v3_struct_0(X4)
| ~ v2_pre_topc(X4)
| ~ l1_pre_topc(X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ v1_tsp_2(X5,X4)
| ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X4)))
| ~ v4_pre_topc(X6,X4)
| X6 = k3_tex_4(X4,k5_subset_1(u1_struct_0(X4),X5,X6)) ),
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)],[t5_tsp_2])])])])])]) ).
fof(c_0_6,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)))
& v1_tsp_2(esk2_0,esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& k6_pre_topc(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k6_pre_topc(esk1_0,esk3_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_4])])])])])]) ).
cnf(c_0_7,plain,
( X1 = k3_tex_4(X2,k5_subset_1(u1_struct_0(X2),X3,X1))
| v3_struct_0(X2)
| ~ v4_pre_topc(X1,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_tsp_2(X3,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X2)))
| ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
k6_pre_topc(esk1_0,esk3_0) != k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,k6_pre_topc(esk1_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( k3_tex_4(esk1_0,k5_subset_1(u1_struct_0(esk1_0),esk2_0,X1)) = X1
| ~ v4_pre_topc(X1,esk1_0)
| ~ m1_subset_1(X1,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11])]),c_0_12]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| v4_pre_topc(k6_pre_topc(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_tops_1])]) ).
cnf(c_0_16,negated_conjecture,
( ~ v4_pre_topc(k6_pre_topc(esk1_0,esk3_0),esk1_0)
| ~ m1_subset_1(k6_pre_topc(esk1_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( v4_pre_topc(k6_pre_topc(X1,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]) ).
cnf(c_0_18,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ l1_pre_topc(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| m1_subset_1(k6_pre_topc(X3,X4),k1_zfmisc_1(u1_struct_0(X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])]) ).
cnf(c_0_20,negated_conjecture,
~ m1_subset_1(k6_pre_topc(esk1_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
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_18]),c_0_10]),c_0_11])]) ).
cnf(c_0_21,plain,
( m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : TOP026+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.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 09:22:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.021 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 23
% 0.21/1.40 # Proof object clause steps : 14
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 14
% 0.21/1.40 # Proof object clause conjectures : 11
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 10
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 4
% 0.21/1.40 # Proof object simplifying inferences : 12
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 78
% 0.21/1.40 # Removed by relevancy pruning/SinE : 27
% 0.21/1.40 # Initial clauses : 135
% 0.21/1.40 # Removed in clause preprocessing : 3
% 0.21/1.40 # Initial clauses in saturation : 132
% 0.21/1.40 # Processed clauses : 243
% 0.21/1.40 # ...of these trivial : 17
% 0.21/1.40 # ...subsumed : 34
% 0.21/1.40 # ...remaining for further processing : 192
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 1
% 0.21/1.40 # Generated clauses : 548
% 0.21/1.40 # ...of the previous two non-trivial : 467
% 0.21/1.40 # Contextual simplify-reflections : 4
% 0.21/1.40 # Paramodulations : 548
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 191
% 0.21/1.40 # Positive orientable unit clauses : 30
% 0.21/1.40 # Positive unorientable unit clauses: 2
% 0.21/1.40 # Negative unit clauses : 5
% 0.21/1.40 # Non-unit-clauses : 154
% 0.21/1.40 # Current number of unprocessed clauses: 342
% 0.21/1.40 # ...number of literals in the above : 1107
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 1
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 4498
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 2654
% 0.21/1.40 # Non-unit clause-clause subsumptions : 34
% 0.21/1.40 # Unit Clause-clause subsumption calls : 44
% 0.21/1.40 # Rewrite failures with RHS unbound : 10
% 0.21/1.40 # BW rewrite match attempts : 7
% 0.21/1.40 # BW rewrite match successes : 7
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 12842
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.034 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.036 s
% 0.21/1.40 # Maximum resident set size: 3748 pages
%------------------------------------------------------------------------------