TSTP Solution File: SWV411+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 : Wed Jul 20 18:16:30 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 57 ( 14 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 57 ( 20 ~; 21 |; 8 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 17 sgn 39 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l47_co,conjecture,
! [X1] :
( ! [X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) )
=> ! [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
=> ? [X7] : pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l47_co) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ! [X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) )
=> ! [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
=> ? [X7] : pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
inference(assume_negation,[status(cth)],[l47_co]) ).
fof(c_0_4,negated_conjecture,
! [X9,X14] :
( ( ~ contains_slb(esk1_0,X9)
| pair_in_list(esk1_0,X9,esk2_1(X9)) )
& contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)
& ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X14) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_5,plain,
! [X6,X7,X8,X9,X10,X6,X7,X8,X9,X10] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X6,X8,X10)
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X7 != X8
| X9 != X10
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ~ contains_slb(X5,X7)
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) )
& ( X6 != X7
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
cnf(c_0_7,negated_conjecture,
~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
~ pair_in_list(esk1_0,esk3_0,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( pair_in_list(esk1_0,X1,esk2_1(X1))
| ~ contains_slb(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( esk3_0 = esk4_0
| contains_slb(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ contains_slb(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk3_0 = esk4_0,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk4_0,X1),
inference(rw,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_18,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 23:20:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.016 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 20
% 0.24/1.42 # Proof object clause steps : 13
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 12
% 0.24/1.42 # Proof object clause conjectures : 9
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 6
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 4
% 0.24/1.42 # Proof object simplifying inferences : 4
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 19
% 0.24/1.42 # Removed by relevancy pruning/SinE : 9
% 0.24/1.42 # Initial clauses : 17
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 17
% 0.24/1.42 # Processed clauses : 33
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 4
% 0.24/1.42 # ...remaining for further processing : 29
% 0.24/1.42 # Other redundant clauses eliminated : 3
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 4
% 0.24/1.42 # Generated clauses : 38
% 0.24/1.42 # ...of the previous two non-trivial : 28
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 27
% 0.24/1.42 # Factorizations : 8
% 0.24/1.42 # Equation resolutions : 3
% 0.24/1.42 # Current number of processed clauses : 22
% 0.24/1.42 # Positive orientable unit clauses : 5
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 5
% 0.24/1.42 # Non-unit-clauses : 12
% 0.24/1.42 # Current number of unprocessed clauses: 12
% 0.24/1.42 # ...number of literals in the above : 45
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 5
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 51
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 51
% 0.24/1.42 # Non-unit clause-clause subsumptions : 4
% 0.24/1.42 # Unit Clause-clause subsumption calls : 33
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 8
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1431
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.016 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2948 pages
%------------------------------------------------------------------------------