TSTP Solution File: SWV403+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV403+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:34:43 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 9 unt; 0 def)
% Number of atoms : 114 ( 24 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 113 ( 42 ~; 45 |; 15 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 99 ( 6 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l39_co,conjecture,
! [X1] :
( ! [X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) )
=> ! [X5,X6,X7,X8,X9] :
( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
& strictly_less_than(X6,X7) )
=> pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l39_co) ).
fof(ax29,axiom,
! [X1,X2,X3,X4] :
( strictly_less_than(X4,X3)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax29) ).
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(ax30,axiom,
! [X1,X2,X3,X4] :
( less_than(X3,X4)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax30) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) )
=> ! [X5,X6,X7,X8,X9] :
( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
& strictly_less_than(X6,X7) )
=> pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7) ) ),
inference(assume_negation,[status(cth)],[l39_co]) ).
fof(c_0_7,negated_conjecture,
! [X11,X12,X13] :
( ( ~ pair_in_list(esk1_0,X11,X12)
| ~ strictly_less_than(X12,X13)
| pair_in_list(update_slb(esk1_0,X13),X11,X13) )
& pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)
& strictly_less_than(esk3_0,esk4_0)
& ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0) ),
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_6])])])])]) ).
fof(c_0_8,plain,
! [X27,X28,X29,X30] :
( ~ strictly_less_than(X30,X29)
| update_slb(insert_slb(X27,pair(X28,X30)),X29) = insert_slb(update_slb(X27,X29),pair(X28,X29)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])])]) ).
fof(c_0_9,plain,
! [X21,X22,X23,X24,X25] :
( ( X22 = X23
| pair_in_list(X21,X23,X25)
| ~ pair_in_list(insert_slb(X21,pair(X22,X24)),X23,X25) )
& ( X24 = X25
| pair_in_list(X21,X23,X25)
| ~ pair_in_list(insert_slb(X21,pair(X22,X24)),X23,X25) )
& ( ~ pair_in_list(X21,X23,X25)
| pair_in_list(insert_slb(X21,pair(X22,X24)),X23,X25) )
& ( X22 != X23
| X24 != X25
| pair_in_list(insert_slb(X21,pair(X22,X24)),X23,X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
fof(c_0_10,plain,
! [X31,X32,X33,X34] :
( ~ less_than(X33,X34)
| update_slb(insert_slb(X31,pair(X32,X34)),X33) = insert_slb(update_slb(X31,X33),pair(X32,X34)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])])]) ).
cnf(c_0_11,negated_conjecture,
~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( update_slb(insert_slb(X3,pair(X4,X1)),X2) = insert_slb(update_slb(X3,X2),pair(X4,X2))
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X1 = X2
| pair_in_list(X3,X4,X2)
| ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
cnf(c_0_16,plain,
( update_slb(insert_slb(X3,pair(X4,X2)),X1) = insert_slb(update_slb(X3,X1),pair(X4,X2))
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0)
| ~ strictly_less_than(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)
| ~ pair_in_list(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X3),X1,X3)
| ~ pair_in_list(esk1_0,X1,X2)
| ~ strictly_less_than(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_21,plain,
! [X35,X36] :
( ( less_than(X35,X36)
| ~ strictly_less_than(X35,X36) )
& ( ~ less_than(X36,X35)
| ~ strictly_less_than(X35,X36) )
& ( ~ less_than(X35,X36)
| less_than(X36,X35)
| strictly_less_than(X35,X36) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_22,plain,
! [X41,X42] :
( less_than(X41,X42)
| less_than(X42,X41) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_23,negated_conjecture,
( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk6_0)),esk2_0,esk4_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)
| ~ strictly_less_than(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
strictly_less_than(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( esk6_0 = esk3_0
| ~ strictly_less_than(esk6_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( esk6_0 = esk3_0
| ~ less_than(esk4_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
( X1 = X2
| pair_in_list(X3,X2,X4)
| ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
esk6_0 = esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( esk2_0 = esk5_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_36,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_34]),c_0_26])]) ).
cnf(c_0_37,negated_conjecture,
( esk2_0 = esk5_0
| pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_38,plain,
( pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_34]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
esk2_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_26])]) ).
cnf(c_0_41,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV403+1 : TPTP v8.2.0. Released v3.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.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 : 300
% 0.13/0.35 % DateTime : Sun May 19 06:44:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 3676 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSS-FFMF22-MFFFFFNN
% 0.20/0.50 # partial match(1): FGHSM-FFMF22-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 3683 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSS-FFMF22-MFFFFFNN
% 0.20/0.50 # partial match(1): FGHSM-FFMF22-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 19
% 0.20/0.50 # Removed by relevancy pruning/SinE : 7
% 0.20/0.50 # Initial clauses : 22
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 22
% 0.20/0.50 # Processed clauses : 80
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 12
% 0.20/0.50 # ...remaining for further processing : 68
% 0.20/0.50 # Other redundant clauses eliminated : 3
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 16
% 0.20/0.50 # Generated clauses : 63
% 0.20/0.50 # ...of the previous two non-redundant : 59
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 59
% 0.20/0.50 # Factorizations : 2
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 3
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 27
% 0.20/0.50 # ...of those cached : 20
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 28
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 17
% 0.20/0.50 # Current number of unprocessed clauses: 21
% 0.20/0.50 # ...number of literals in the above : 63
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 38
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 84
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 73
% 0.20/0.50 # Non-unit clause-clause subsumptions : 9
% 0.20/0.50 # Unit Clause-clause subsumption calls : 31
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 6
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 2219
% 0.20/0.50 # Search garbage collected termcells : 357
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1724 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.015 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------