TSTP Solution File: SWC009+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC009+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:38:50 EDT 2023
% Result : Timeout 0.53s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 12 unt; 0 def)
% Number of atoms : 100 ( 40 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 119 ( 40 ~; 35 |; 33 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn; 19 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X3,X8) != X4
| ~ strictorderedP(X3)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X3
& lt(X11,X9) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.8Fi5K4aB61/E---3.1_21821.p',co1) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.8Fi5K4aB61/E---3.1_21821.p',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.8Fi5K4aB61/E---3.1_21821.p',ax17) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) )
| ! [X8] :
( ssList(X8)
=> ( app(X3,X8) != X4
| ~ strictorderedP(X3)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X8
& ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X3
& lt(X11,X9) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
! [X17,X18,X19,X21,X22,X23,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X17)
| ~ ssList(X18)
| ~ ssList(X19)
| app(app(X17,X18),X19) != esk2_0
| app(X17,X19) != esk1_0 )
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X21)
| ~ ssList(X22)
| app(cons(X21,nil),X22) != esk5_0
| ~ ssItem(X23)
| ~ ssList(X24)
| app(X24,cons(X23,nil)) != esk3_0
| ~ lt(X23,X21) )
& ( nil = esk4_0
| nil != esk3_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != esk2_0
| app(X1,X3) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( app(app(X1,X2),X3) != esk4_0
| app(X1,X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_8,c_0_6]) ).
fof(c_0_13,plain,
! [X62] :
( ~ ssList(X62)
| app(X62,nil) = X62 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( app(esk4_0,X1) != esk4_0
| app(esk3_0,X1) != esk3_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
app(esk3_0,nil) != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC009+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 01:46:30 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.8Fi5K4aB61/E---3.1_21821.p
% 0.53/300.16 # Version: 3.1pre001
% 0.53/300.16 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/300.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.53/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.53/300.16 # Starting sh5l with 300s (1) cores
% 0.53/300.16 # new_bool_1 with pid 22000 completed with status 0
% 0.53/300.16 # Result found by new_bool_1
% 0.53/300.16 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/300.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.53/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.53/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/300.16 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.53/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.53/300.16 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22010 completed with status 0
% 0.53/300.16 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/300.16 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/300.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.53/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.53/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/300.16 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.53/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.53/300.16 # Preprocessing time : 0.002 s
% 0.53/300.16 # Presaturation interreduction done
% 0.53/300.16
% 0.53/300.16 # Proof found!
% 0.53/300.16 # SZS status Theorem
% 0.53/300.16 # SZS output start CNFRefutation
% See solution above
% 0.53/300.16 # Parsed axioms : 96
% 0.53/300.16 # Removed by relevancy pruning/SinE : 56
% 0.53/300.16 # Initial clauses : 73
% 0.53/300.16 # Removed in clause preprocessing : 1
% 0.53/300.16 # Initial clauses in saturation : 72
% 0.53/300.16 # Processed clauses : 185
% 0.53/300.16 # ...of these trivial : 2
% 0.53/300.16 # ...subsumed : 9
% 0.53/300.16 # ...remaining for further processing : 174
% 0.53/300.16 # Other redundant clauses eliminated : 9
% 0.53/300.16 # Clauses deleted for lack of memory : 0
% 0.53/300.16 # Backward-subsumed : 0
% 0.53/300.16 # Backward-rewritten : 0
% 0.53/300.16 # Generated clauses : 439
% 0.53/300.16 # ...of the previous two non-redundant : 398
% 0.53/300.16 # ...aggressively subsumed : 0
% 0.53/300.16 # Contextual simplify-reflections : 0
% 0.53/300.16 # Paramodulations : 427
% 0.53/300.16 # Factorizations : 0
% 0.53/300.16 # NegExts : 0
% 0.53/300.16 # Equation resolutions : 13
% 0.53/300.16 # Total rewrite steps : 103
% 0.53/300.16 # Propositional unsat checks : 0
% 0.53/300.16 # Propositional check models : 0
% 0.53/300.16 # Propositional check unsatisfiable : 0
% 0.53/300.16 # Propositional clauses : 0
% 0.53/300.16 # Propositional clauses after purity: 0
% 0.53/300.16 # Propositional unsat core size : 0
% 0.53/300.16 # Propositional preprocessing time : 0.000
% 0.53/300.16 # Propositional encoding time : 0.000
% 0.53/300.16 # Propositional solver time : 0.000
% 0.53/300.16 # Success case prop preproc time : 0.000
% 0.53/300.16 # Success case prop encoding time : 0.000
% 0.53/300.16 # Success case prop solver time : 0.000
% 0.53/300.16 # Current number of processed clauses : 103
% 0.53/300.16 # Positive orientable unit clauses : 12
% 0.53/300.16 # Positive unorientable unit clauses: 0
% 0.53/300.16 # Negative unit clauses : 2
% 0.53/300.16 # Non-unit-clauses : 89
% 0.53/300.16 # Current number of unprocessed clauses: 352
% 0.53/300.16 # ...number of literals in the above : 1345
% 0.53/300.16 # Current number of archived formulas : 0
% 0.53/300.16 # Current number of archived clauses : 67
% 0.53/300.16 # Clause-clause subsumption calls (NU) : 1257
% 0.53/300.16 # Rec. Clause-clause subsumption calls : 375
% 0.53/300.16 # Non-unit clause-clause subsumptions : 9
% 0.53/300.16 # Unit Clause-clause subsumption calls : 3
% 0.53/300.16 # Rewrite failures with RHS unbound : 0
% 0.53/300.16 # BW rewrite match attempts : 0
% 0.53/300.16 # BW rewrite match successes : 0
% 0.53/300.16 # Condensation attempts : 0
% 0.53/300.16 # Condensation successes : 0
% 0.53/300.16 # Termbank termtop insertions : 12288
% 0.53/300.16
% 0.53/300.16 # -------------------------------------------------
% 0.53/300.16 # User time : 0.020 s
% 0.53/300.16 # System time : 0.002 s
% 0.53/300.16 # Total time : 0.022 s
% 0.53/300.16 # Maximum resident set size: 2044 pages
% 0.53/300.16
% 0.53/300.16 # -------------------------------------------------
% 0.53/300.16 # User time : 0.022 s
% 0.53/300.16 # System time : 0.006 s
% 0.53/300.16 # Total time : 0.028 s
% 0.53/300.16 # Maximum resident set size: 1804 pages
% 0.53/300.16 % E---3.1 exiting
% 0.53/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------