TSTP Solution File: SWC420-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC420-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:43:06 EDT 2023
% Result : Unsatisfiable 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 50 ( 22 unt; 4 nHn; 46 RR)
% Number of literals : 107 ( 48 equ; 59 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_6) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause109) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause120) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause13) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_5) ).
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(app(X3,cons(X1,nil)),X2) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_8) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_1) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause74) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause86) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',co1_7) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FfCFhw9i07/E---3.1_29726.p',clause115) ).
cnf(c_0_17,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
co1_9 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_20,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_21,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_22,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_23,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(app(X3,cons(X1,nil)),X2) != sk1 ),
co1_8 ).
cnf(c_0_26,negated_conjecture,
( app(X1,cons(X2,nil)) = sk1
| app(cons(X2,nil),X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( app(cons(skaf83(X1),nil),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != sk1
| app(app(X3,cons(X2,nil)),X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( app(skaf82(sk4),cons(skaf83(sk4),nil)) = sk1
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21]),c_0_22])])]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
( nil = sk4
| app(app(X1,cons(skaf83(sk4),nil)),skaf82(sk4)) != sk4
| app(sk1,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]),c_0_22])]) ).
cnf(c_0_32,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_35,negated_conjecture,
( nil = sk4
| app(app(nil,cons(skaf83(sk4),nil)),skaf82(sk4)) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_36,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_37,negated_conjecture,
( nil = sk4
| app(cons(skaf83(sk4),nil),skaf82(sk4)) != sk4
| ~ ssList(cons(skaf83(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_10 ).
cnf(c_0_39,negated_conjecture,
( nil = sk4
| ~ ssList(cons(skaf83(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_28])]) ).
cnf(c_0_40,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_41,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_42,negated_conjecture,
( nil = sk1
| nil != sk4 ),
inference(rw,[status(thm)],[c_0_38,c_0_18]) ).
cnf(c_0_43,negated_conjecture,
nil = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_21]),c_0_33])]) ).
cnf(c_0_44,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_45,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_41,c_0_24]) ).
cnf(c_0_46,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43])]) ).
cnf(c_0_47,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
neq(sk1,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_43]),c_0_46]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC420-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:56:29 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.FfCFhw9i07/E---3.1_29726.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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29812 completed with status 0
% 0.17/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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 # No SInE strategy applied
% 0.17/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.17/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.17/0.53 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 29820 completed with status 0
% 0.17/0.53 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 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 # No SInE strategy applied
% 0.17/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.17/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.17/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.17/0.53 # Preprocessing time : 0.002 s
% 0.17/0.53
% 0.17/0.53 # Proof found!
% 0.17/0.53 # SZS status Unsatisfiable
% 0.17/0.53 # SZS output start CNFRefutation
% See solution above
% 0.17/0.53 # Parsed axioms : 195
% 0.17/0.53 # Removed by relevancy pruning/SinE : 0
% 0.17/0.53 # Initial clauses : 195
% 0.17/0.53 # Removed in clause preprocessing : 0
% 0.17/0.53 # Initial clauses in saturation : 195
% 0.17/0.53 # Processed clauses : 775
% 0.17/0.53 # ...of these trivial : 2
% 0.17/0.53 # ...subsumed : 371
% 0.17/0.53 # ...remaining for further processing : 402
% 0.17/0.53 # Other redundant clauses eliminated : 160
% 0.17/0.53 # Clauses deleted for lack of memory : 0
% 0.17/0.53 # Backward-subsumed : 23
% 0.17/0.53 # Backward-rewritten : 142
% 0.17/0.53 # Generated clauses : 2219
% 0.17/0.53 # ...of the previous two non-redundant : 2012
% 0.17/0.53 # ...aggressively subsumed : 0
% 0.17/0.53 # Contextual simplify-reflections : 25
% 0.17/0.53 # Paramodulations : 2052
% 0.17/0.53 # Factorizations : 0
% 0.17/0.53 # NegExts : 0
% 0.17/0.53 # Equation resolutions : 168
% 0.17/0.53 # Total rewrite steps : 2060
% 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 : 214
% 0.17/0.53 # Positive orientable unit clauses : 55
% 0.17/0.53 # Positive unorientable unit clauses: 0
% 0.17/0.53 # Negative unit clauses : 2
% 0.17/0.53 # Non-unit-clauses : 157
% 0.17/0.53 # Current number of unprocessed clauses: 1378
% 0.17/0.53 # ...number of literals in the above : 7553
% 0.17/0.53 # Current number of archived formulas : 0
% 0.17/0.53 # Current number of archived clauses : 165
% 0.17/0.53 # Clause-clause subsumption calls (NU) : 14352
% 0.17/0.53 # Rec. Clause-clause subsumption calls : 4033
% 0.17/0.53 # Non-unit clause-clause subsumptions : 319
% 0.17/0.53 # Unit Clause-clause subsumption calls : 134
% 0.17/0.53 # Rewrite failures with RHS unbound : 0
% 0.17/0.53 # BW rewrite match attempts : 7
% 0.17/0.53 # BW rewrite match successes : 7
% 0.17/0.53 # Condensation attempts : 0
% 0.17/0.53 # Condensation successes : 0
% 0.17/0.53 # Termbank termtop insertions : 42773
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.059 s
% 0.17/0.53 # System time : 0.007 s
% 0.17/0.53 # Total time : 0.066 s
% 0.17/0.53 # Maximum resident set size: 2112 pages
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.282 s
% 0.17/0.53 # System time : 0.025 s
% 0.17/0.53 # Total time : 0.307 s
% 0.17/0.53 # Maximum resident set size: 1848 pages
% 0.17/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------