TSTP Solution File: SWC331+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC331+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:42:37 EDT 2023
% Result : Theorem 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 120 ( 31 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 147 ( 53 ~; 50 |; 28 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn; 25 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.G1NDNfqqQU/E---3.1_26542.p',ax7) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.G1NDNfqqQU/E---3.1_26542.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.G1NDNfqqQU/E---3.1_26542.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.G1NDNfqqQU/E---3.1_26542.p',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.G1NDNfqqQU/E---3.1_26542.p',ax17) ).
fof(c_0_5,plain,
! [X27,X28,X31,X32] :
( ( ssList(esk10_2(X27,X28))
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ssList(esk11_2(X27,X28))
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( app(app(esk10_2(X27,X28),X28),esk11_2(X27,X28)) = X27
| ~ segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| app(app(X31,X28),X32) != X27
| segmentP(X27,X28)
| ~ ssList(X28)
| ~ ssList(X27) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_7,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X50] :
( ~ ssList(X50)
| app(nil,X50) = X50 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_9,plain,
! [X64,X65] :
( ~ ssList(X64)
| ~ ssList(X65)
| ssList(app(X64,X65)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_10,negated_conjecture,
! [X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X14)
| ~ ssList(X15)
| app(cons(X14,nil),X15) != esk5_0
| ~ ssList(X16)
| app(X16,cons(X14,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ equalelemsP(esk1_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ equalelemsP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
equalelemsP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_21,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16]),c_0_18]),c_0_19]),c_0_16])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC331+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:43:35 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.G1NDNfqqQU/E---3.1_26542.p
% 0.17/0.53 # Version: 3.1pre001
% 0.17/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # sh5l with pid 26622 completed with status 0
% 0.17/0.53 # Result found by sh5l
% 0.17/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.53 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.17/0.53 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 26625 completed with status 0
% 0.17/0.53 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.17/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.53 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.17/0.53 # Preprocessing time : 0.003 s
% 0.17/0.53 # Presaturation interreduction done
% 0.17/0.53
% 0.17/0.53 # Proof found!
% 0.17/0.53 # SZS status Theorem
% 0.17/0.53 # SZS output start CNFRefutation
% See solution above
% 0.17/0.53 # Parsed axioms : 96
% 0.17/0.53 # Removed by relevancy pruning/SinE : 11
% 0.17/0.53 # Initial clauses : 173
% 0.17/0.53 # Removed in clause preprocessing : 2
% 0.17/0.53 # Initial clauses in saturation : 171
% 0.17/0.53 # Processed clauses : 811
% 0.17/0.53 # ...of these trivial : 12
% 0.17/0.53 # ...subsumed : 184
% 0.17/0.53 # ...remaining for further processing : 615
% 0.17/0.53 # Other redundant clauses eliminated : 60
% 0.17/0.53 # Clauses deleted for lack of memory : 0
% 0.17/0.53 # Backward-subsumed : 39
% 0.17/0.53 # Backward-rewritten : 43
% 0.17/0.53 # Generated clauses : 2129
% 0.17/0.53 # ...of the previous two non-redundant : 1650
% 0.17/0.53 # ...aggressively subsumed : 0
% 0.17/0.53 # Contextual simplify-reflections : 63
% 0.17/0.53 # Paramodulations : 2065
% 0.17/0.53 # Factorizations : 0
% 0.17/0.53 # NegExts : 0
% 0.17/0.53 # Equation resolutions : 65
% 0.17/0.53 # Total rewrite steps : 2045
% 0.17/0.53 # Propositional unsat checks : 0
% 0.17/0.53 # Propositional check models : 0
% 0.17/0.53 # Propositional check unsatisfiable : 0
% 0.17/0.53 # Propositional clauses : 0
% 0.17/0.53 # Propositional clauses after purity: 0
% 0.17/0.53 # Propositional unsat core size : 0
% 0.17/0.53 # Propositional preprocessing time : 0.000
% 0.17/0.53 # Propositional encoding time : 0.000
% 0.17/0.53 # Propositional solver time : 0.000
% 0.17/0.53 # Success case prop preproc time : 0.000
% 0.17/0.53 # Success case prop encoding time : 0.000
% 0.17/0.53 # Success case prop solver time : 0.000
% 0.17/0.53 # Current number of processed clauses : 351
% 0.17/0.53 # Positive orientable unit clauses : 59
% 0.17/0.53 # Positive unorientable unit clauses: 0
% 0.17/0.53 # Negative unit clauses : 2
% 0.17/0.53 # Non-unit-clauses : 290
% 0.17/0.53 # Current number of unprocessed clauses: 1026
% 0.17/0.53 # ...number of literals in the above : 6022
% 0.17/0.53 # Current number of archived formulas : 0
% 0.17/0.53 # Current number of archived clauses : 247
% 0.17/0.53 # Clause-clause subsumption calls (NU) : 22229
% 0.17/0.53 # Rec. Clause-clause subsumption calls : 8913
% 0.17/0.53 # Non-unit clause-clause subsumptions : 286
% 0.17/0.53 # Unit Clause-clause subsumption calls : 1187
% 0.17/0.53 # Rewrite failures with RHS unbound : 0
% 0.17/0.53 # BW rewrite match attempts : 16
% 0.17/0.53 # BW rewrite match successes : 16
% 0.17/0.53 # Condensation attempts : 0
% 0.17/0.53 # Condensation successes : 0
% 0.17/0.53 # Termbank termtop insertions : 51171
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.069 s
% 0.17/0.53 # System time : 0.006 s
% 0.17/0.53 # Total time : 0.075 s
% 0.17/0.53 # Maximum resident set size: 2424 pages
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.072 s
% 0.17/0.53 # System time : 0.008 s
% 0.17/0.53 # Total time : 0.080 s
% 0.17/0.53 # Maximum resident set size: 1800 pages
% 0.17/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------