TSTP Solution File: SWV405+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV405+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 18:16:29 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 20 ( 9 ~; 5 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 22 ( 4 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l41_co,conjecture,
! [X1,X2] :
( check_cpq(triple(X1,create_slb,X2))
<=> ! [X3,X4] :
( pair_in_list(create_slb,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l41_co) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(ax22,axiom,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax22) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( check_cpq(triple(X1,create_slb,X2))
<=> ! [X3,X4] :
( pair_in_list(create_slb,X3,X4)
=> less_than(X4,X3) ) ),
inference(assume_negation,[status(cth)],[l41_co]) ).
fof(c_0_4,negated_conjecture,
! [X9,X10] :
( ( pair_in_list(create_slb,esk3_0,esk4_0)
| ~ check_cpq(triple(esk1_0,create_slb,esk2_0)) )
& ( ~ less_than(esk4_0,esk3_0)
| ~ check_cpq(triple(esk1_0,create_slb,esk2_0)) )
& ( check_cpq(triple(esk1_0,create_slb,esk2_0))
| ~ pair_in_list(create_slb,X9,X10)
| less_than(X10,X9) ) ),
inference(distribute,[status(thm)],[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,
! [X3,X4] : check_cpq(triple(X3,create_slb,X4)),
inference(variable_rename,[status(thm)],[ax36]) ).
fof(c_0_6,plain,
! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax22])]) ).
cnf(c_0_7,negated_conjecture,
( pair_in_list(create_slb,esk3_0,esk4_0)
| ~ check_cpq(triple(esk1_0,create_slb,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV405+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 12:05:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.018 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 11
% 0.25/1.43 # Proof object clause steps : 4
% 0.25/1.43 # Proof object formula steps : 7
% 0.25/1.43 # Proof object conjectures : 5
% 0.25/1.43 # Proof object clause conjectures : 2
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 3
% 0.25/1.43 # Proof object initial formulas used : 3
% 0.25/1.43 # Proof object generating inferences : 0
% 0.25/1.43 # Proof object simplifying inferences : 3
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 42
% 0.25/1.43 # Removed by relevancy pruning/SinE : 15
% 0.25/1.43 # Initial clauses : 37
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 37
% 0.25/1.43 # Processed clauses : 38
% 0.25/1.43 # ...of these trivial : 1
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 36
% 0.25/1.43 # Other redundant clauses eliminated : 3
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 2
% 0.25/1.43 # Generated clauses : 25
% 0.25/1.43 # ...of the previous two non-trivial : 19
% 0.25/1.43 # Contextual simplify-reflections : 2
% 0.25/1.43 # Paramodulations : 21
% 0.25/1.43 # Factorizations : 2
% 0.25/1.43 # Equation resolutions : 3
% 0.25/1.43 # Current number of processed clauses : 32
% 0.25/1.43 # Positive orientable unit clauses : 7
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 23
% 0.25/1.43 # Current number of unprocessed clauses: 18
% 0.25/1.43 # ...number of literals in the above : 54
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 2
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 69
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 45
% 0.25/1.43 # Non-unit clause-clause subsumptions : 2
% 0.25/1.43 # Unit Clause-clause subsumption calls : 3
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 2
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 3111
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.017 s
% 0.25/1.43 # System time : 0.003 s
% 0.25/1.43 # Total time : 0.020 s
% 0.25/1.43 # Maximum resident set size: 3056 pages
%------------------------------------------------------------------------------