TSTP Solution File: SWV401+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV401+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Sat May 4 09:44:02 EDT 2024
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% 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/sandbox2/tmp/tmp.jvErDj5OJ8/E---3.1_11115.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/sandbox2/tmp/tmp.jvErDj5OJ8/E---3.1_11115.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/sandbox2/tmp/tmp.jvErDj5OJ8/E---3.1_11115.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/sandbox2/tmp/tmp.jvErDj5OJ8/E---3.1_11115.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/sandbox2/tmp/tmp.jvErDj5OJ8/E---3.1_11115.p',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jvErDj5OJ8/E---3.1_11115.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,
! [X11,X12,X13] :
( ( ~ pair_in_list(esk1_0,X11,X12)
| ~ less_than(X13,X12)
| pair_in_list(update_slb(esk1_0,X13),X11,X12) )
& 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,
! [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,
! [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_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,
! [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_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,
! [X62,X63] :
( ( less_than(X62,X63)
| ~ strictly_less_than(X62,X63) )
& ( ~ less_than(X63,X62)
| ~ strictly_less_than(X62,X63) )
& ( ~ less_than(X62,X63)
| less_than(X63,X62)
| strictly_less_than(X62,X63) ) ),
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,
! [X59,X60] :
( less_than(X59,X60)
| less_than(X60,X59) ),
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.02/0.10 % Problem : SWV401+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n015.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 16:31:08 EDT 2024
% 0.17/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 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/tmp/tmp.jvErDj5OJ8/E---3.1_11115.p
% 0.17/0.44 # Version: 3.1.0
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # sh5l with pid 11197 completed with status 0
% 0.17/0.44 # Result found by sh5l
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.44 # Search class: FGHSM-FFMF22-MFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 11205 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.44 # Search class: FGHSM-FFMF22-MFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 19
% 0.17/0.44 # Removed by relevancy pruning/SinE : 1
% 0.17/0.44 # Initial clauses : 28
% 0.17/0.44 # Removed in clause preprocessing : 0
% 0.17/0.44 # Initial clauses in saturation : 28
% 0.17/0.44 # Processed clauses : 87
% 0.17/0.44 # ...of these trivial : 1
% 0.17/0.44 # ...subsumed : 7
% 0.17/0.44 # ...remaining for further processing : 78
% 0.17/0.44 # Other redundant clauses eliminated : 3
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 2
% 0.17/0.44 # Backward-rewritten : 9
% 0.17/0.44 # Generated clauses : 70
% 0.17/0.44 # ...of the previous two non-redundant : 64
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 2
% 0.17/0.44 # Paramodulations : 64
% 0.17/0.44 # Factorizations : 2
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 3
% 0.17/0.44 # Disequality decompositions : 0
% 0.17/0.44 # Total rewrite steps : 34
% 0.17/0.44 # ...of those cached : 27
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 35
% 0.17/0.44 # Positive orientable unit clauses : 10
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 5
% 0.17/0.44 # Non-unit-clauses : 20
% 0.17/0.44 # Current number of unprocessed clauses: 32
% 0.17/0.44 # ...number of literals in the above : 89
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 41
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 161
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 145
% 0.17/0.44 # Non-unit clause-clause subsumptions : 7
% 0.17/0.44 # Unit Clause-clause subsumption calls : 46
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 11
% 0.17/0.44 # BW rewrite match successes : 2
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 2646
% 0.17/0.44 # Search garbage collected termcells : 361
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.008 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.009 s
% 0.17/0.44 # Maximum resident set size: 1832 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.009 s
% 0.17/0.44 # System time : 0.003 s
% 0.17/0.44 # Total time : 0.012 s
% 0.17/0.44 # Maximum resident set size: 1748 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.44 % E exiting
%------------------------------------------------------------------------------