TSTP Solution File: SWV413+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV413+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 300s
% DateTime : Tue May 21 05:23:14 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 31 ( 11 ~; 7 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l49_co,conjecture,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_co) ).
fof(l49_li3637,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& less_than(X4,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_li3637) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
inference(assume_negation,[status(cth)],[l49_co]) ).
fof(c_0_3,negated_conjecture,
! [X10] :
( pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk4_0)
& less_than(esk4_0,esk3_0)
& ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X10)
| ~ less_than(esk4_0,X10) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
fof(c_0_4,lemma,
! [X24,X25,X26,X27] :
( ~ pair_in_list(X24,X25,X26)
| ~ less_than(X27,X26)
| pair_in_list(update_slb(X24,X27),X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l49_li3637])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X1)
| ~ less_than(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,lemma,
( pair_in_list(update_slb(X1,X4),X2,X3)
| ~ pair_in_list(X1,X2,X3)
| ~ less_than(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,X1)
| ~ less_than(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV413+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 09:03:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 29783 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSS-FFMS22-MFFFFFNN
% 0.19/0.48 # partial match(1): FGHSS-FFMS22-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 29787 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSS-FFMS22-MFFFFFNN
% 0.19/0.48 # partial match(1): FGHSS-FFMS22-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 20
% 0.19/0.48 # Removed by relevancy pruning/SinE : 7
% 0.19/0.48 # Initial clauses : 23
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 23
% 0.19/0.48 # Processed clauses : 52
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 2
% 0.19/0.48 # ...remaining for further processing : 50
% 0.19/0.48 # Other redundant clauses eliminated : 3
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 24
% 0.19/0.48 # ...of the previous two non-redundant : 15
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 1
% 0.19/0.48 # Paramodulations : 20
% 0.19/0.48 # Factorizations : 2
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 3
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 5
% 0.19/0.48 # ...of those cached : 1
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 25
% 0.19/0.48 # Positive orientable unit clauses : 8
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 3
% 0.19/0.48 # Non-unit-clauses : 14
% 0.19/0.48 # Current number of unprocessed clauses: 9
% 0.19/0.48 # ...number of literals in the above : 24
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 23
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 34
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 34
% 0.19/0.48 # Non-unit clause-clause subsumptions : 3
% 0.19/0.48 # Unit Clause-clause subsumption calls : 3
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 6
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1743
% 0.19/0.48 # Search garbage collected termcells : 324
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.009 s
% 0.19/0.48 # Maximum resident set size: 1840 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.006 s
% 0.19/0.48 # Total time : 0.013 s
% 0.19/0.48 # Maximum resident set size: 1716 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------