TSTP Solution File: SWC010-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC010-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Tue May 21 04:26:54 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 13 unt; 1 nHn; 33 RR)
% Number of literals : 68 ( 20 equ; 38 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(X2,X3) != sk1
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_20,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_21,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
cnf(co1_17,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_19,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_18,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_0_9,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(X2,X3) != sk1
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_11,negated_conjecture,
neq(sk2,nil),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_13,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_14,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_15,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_16,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_17,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk2
| app(X2,X3) != sk1
| ~ neq(sk4,nil) ),
c_0_10 ).
cnf(c_0_19,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
c_0_13 ).
cnf(c_0_21,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
c_0_16 ).
cnf(c_0_25,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
c_0_17 ).
cnf(c_0_26,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != sk4
| app(X1,X3) != sk1
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
cnf(c_0_28,negated_conjecture,
app(sk6,sk7) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_19])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_19])]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_19])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC010-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:10:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18753 completed with status 0
% 0.20/0.49 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.49 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.49 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.20/0.49 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 18762 completed with status 0
% 0.20/0.49 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.20/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.49 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.20/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.49 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.004 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 207
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 207
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 207
% 0.20/0.49 # Processed clauses : 64
% 0.20/0.49 # ...of these trivial : 8
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 56
% 0.20/0.49 # Other redundant clauses eliminated : 2
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 30
% 0.20/0.49 # ...of the previous two non-redundant : 28
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 28
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 2
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 40
% 0.20/0.49 # ...of those cached : 29
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 54
% 0.20/0.49 # Positive orientable unit clauses : 38
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 14
% 0.20/0.49 # Current number of unprocessed clauses: 171
% 0.20/0.49 # ...number of literals in the above : 606
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 0
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 39
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 9
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 6582
% 0.20/0.49 # Search garbage collected termcells : 560
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.010 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 2160 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.044 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.052 s
% 0.20/0.49 # Maximum resident set size: 1880 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------