TSTP Solution File: LDA001-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LDA001-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 00:37:15 EDT 2024
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 16 RR)
% Number of literals : 23 ( 22 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a1,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).
cnf(clause_4,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_3,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(prove_equation,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(clause_2,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(c_0_5,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
a1 ).
cnf(c_0_6,axiom,
u = f(n2,n2),
clause_4 ).
cnf(c_0_7,axiom,
n3 = f(n2,n1),
clause_3 ).
cnf(c_0_8,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
inference(fof_simplification,[status(thm)],[prove_equation]) ).
cnf(c_0_9,plain,
f(f(n2,X1),u) = f(n2,f(X1,n2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
f(f(n2,X1),n3) = f(n2,f(X1,n1)),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_11,axiom,
n2 = f(n1,n1),
clause_2 ).
cnf(c_0_12,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
c_0_8 ).
cnf(c_0_13,plain,
f(u,u) = f(n2,u),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_6]) ).
cnf(c_0_14,plain,
f(n3,n3) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_11]),c_0_6]) ).
cnf(c_0_15,plain,
f(f(n1,X1),n2) = f(n1,f(X1,n1)),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
f(f(n3,n2),u) != f(n2,f(u,n2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).
cnf(c_0_17,plain,
f(f(n3,X1),u) = f(n3,f(X1,n3)),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_18,plain,
f(n1,n2) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_6]),c_0_11]) ).
cnf(c_0_19,negated_conjecture,
f(n3,f(n2,n3)) != f(n2,f(u,n2)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
f(n3,f(n2,X1)) = f(n2,f(n1,X1)),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_21,plain,
f(n1,n3) = f(u,n2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_7]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LDA001-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n018.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 : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat May 18 11:53:07 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Version: 3.1.0
% 0.18/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 26512 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FUUPF-FFSS22-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # SAT001_MinMin_p005000_rr_RG with pid 26517 completed with status 0
% 0.18/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FUUPF-FFSS22-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Unsatisfiable
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 5
% 0.18/0.46 # Removed by relevancy pruning/SinE : 0
% 0.18/0.46 # Initial clauses : 5
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 5
% 0.18/0.46 # Processed clauses : 33
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 0
% 0.18/0.46 # ...remaining for further processing : 33
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 6
% 0.18/0.46 # Generated clauses : 218
% 0.18/0.46 # ...of the previous two non-redundant : 186
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 218
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 113
% 0.18/0.46 # ...of those cached : 36
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 22
% 0.18/0.46 # Positive orientable unit clauses : 22
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 0
% 0.18/0.46 # Non-unit-clauses : 0
% 0.18/0.46 # Current number of unprocessed clauses: 161
% 0.18/0.46 # ...number of literals in the above : 161
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 11
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.46 # Non-unit clause-clause subsumptions : 0
% 0.18/0.46 # Unit Clause-clause subsumption calls : 0
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 7
% 0.18/0.46 # BW rewrite match successes : 6
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 3637
% 0.18/0.46 # Search garbage collected termcells : 2
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.005 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.006 s
% 0.18/0.46 # Maximum resident set size: 1628 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.006 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.009 s
% 0.18/0.46 # Maximum resident set size: 1680 pages
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------