TSTP Solution File: SWV401+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWV401+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Mon Jun 24 16:51:03 EDT 2024
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 107 ( 20 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 108 ( 41 ~; 41 |; 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 : 97 ( 6 sgn 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l37_co,conjecture,
! [X1] :
( ! [X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& less_than(X4,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X3) )
=> ! [X5,X6,X7,X8,X9] :
( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
& less_than(X7,X6) )
=> pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X6) ) ),
file('/export/starexec/sandbox/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p',l37_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/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p',ax29) ).
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/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p',ax30) ).
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/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p',ax23) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p',totality) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& less_than(X4,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X3) )
=> ! [X5,X6,X7,X8,X9] :
( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
& less_than(X7,X6) )
=> pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X6) ) ),
inference(assume_negation,[status(cth)],[l37_co]) ).
fof(c_0_7,negated_conjecture,
! [X58,X59,X60] :
( ( ~ pair_in_list(esk1_0,X58,X59)
| ~ less_than(X60,X59)
| pair_in_list(update_slb(esk1_0,X60),X58,X59) )
& pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)
& less_than(esk4_0,esk3_0)
& ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk3_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,
! [X49,X50,X51,X52] :
( ~ strictly_less_than(X52,X51)
| update_slb(insert_slb(X49,pair(X50,X52)),X51) = insert_slb(update_slb(X49,X51),pair(X50,X51)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])])]) ).
fof(c_0_9,plain,
! [X53,X54,X55,X56] :
( ~ less_than(X55,X56)
| update_slb(insert_slb(X53,pair(X54,X56)),X55) = insert_slb(update_slb(X53,X55),pair(X54,X56)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])])]) ).
cnf(c_0_10,negated_conjecture,
~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,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]) ).
fof(c_0_12,plain,
! [X29,X30,X31,X32,X33] :
( ( X30 = X31
| pair_in_list(X29,X31,X33)
| ~ pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) )
& ( X32 = X33
| pair_in_list(X29,X31,X33)
| ~ pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) )
& ( ~ pair_in_list(X29,X31,X33)
| pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) )
& ( X30 != X31
| X32 != X33
| pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
fof(c_0_13,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_14,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_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk3_0)
| ~ strictly_less_than(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,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_12]) ).
fof(c_0_17,plain,
! [X16,X17] :
( ( less_than(X16,X17)
| ~ strictly_less_than(X16,X17) )
& ( ~ less_than(X17,X16)
| ~ strictly_less_than(X16,X17) )
& ( ~ less_than(X16,X17)
| less_than(X17,X16)
| strictly_less_than(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_18,plain,
! [X13,X14] :
( less_than(X13,X14)
| less_than(X14,X13) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_19,negated_conjecture,
( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk6_0)),esk2_0,esk3_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0)
| ~ strictly_less_than(esk6_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X3),X1,X2)
| ~ pair_in_list(esk1_0,X1,X2)
| ~ less_than(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_26,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_12]) ).
cnf(c_0_27,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]) ).
cnf(c_0_28,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,esk3_0)
| ~ strictly_less_than(esk6_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_29,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,esk3_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_22])]) ).
cnf(c_0_31,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_12]) ).
cnf(c_0_32,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ pair_in_list(esk1_0,esk2_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( esk2_0 = esk5_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_35,plain,
( pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
esk6_0 = esk3_0,
inference(sr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
esk2_0 = esk5_0,
inference(sr,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_38,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_36]),c_0_36]),c_0_22])]),c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV401+1 : TPTP v8.2.0. Released v3.3.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Thu Jun 20 14:18:38 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.jOMNbDIHyn/E---3.1_29154.p
% 0.15/0.41 # Version: 3.2.0
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29232 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FGHSM-FFMF22-MFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.41 # Starting sh5l with 136s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 29237 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FGHSM-FFMF22-MFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 19
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 29
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 29
% 0.15/0.41 # Processed clauses : 90
% 0.15/0.41 # ...of these trivial : 1
% 0.15/0.41 # ...subsumed : 7
% 0.15/0.41 # ...remaining for further processing : 81
% 0.15/0.41 # Other redundant clauses eliminated : 3
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 2
% 0.15/0.41 # Backward-rewritten : 9
% 0.15/0.41 # Generated clauses : 73
% 0.15/0.41 # ...of the previous two non-redundant : 60
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 2
% 0.15/0.41 # Paramodulations : 67
% 0.15/0.41 # Factorizations : 2
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 3
% 0.15/0.41 # Disequality decompositions : 0
% 0.15/0.41 # Total rewrite steps : 42
% 0.15/0.41 # ...of those cached : 33
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 37
% 0.15/0.41 # Positive orientable unit clauses : 11
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 5
% 0.15/0.41 # Non-unit-clauses : 21
% 0.15/0.41 # Current number of unprocessed clauses: 27
% 0.15/0.41 # ...number of literals in the above : 76
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 42
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 155
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 139
% 0.15/0.41 # Non-unit clause-clause subsumptions : 6
% 0.15/0.41 # Unit Clause-clause subsumption calls : 49
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 14
% 0.15/0.41 # BW rewrite match successes : 2
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 2684
% 0.15/0.41 # Search garbage collected termcells : 356
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.005 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.007 s
% 0.15/0.41 # Maximum resident set size: 1788 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.018 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.022 s
% 0.15/0.41 # Maximum resident set size: 1696 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.41 % E exiting
%------------------------------------------------------------------------------