TSTP Solution File: SYN310-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN310-1 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 07:57:49 EDT 2024
% Result : Unsatisfiable 0.12s 0.34s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of clauses : 29 ( 17 unt; 0 nHn; 29 RR)
% Number of literals : 41 ( 0 equ; 15 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause4,negated_conjecture,
( p(X1,X2,X3)
| ~ p(f(X1),X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause1,negated_conjecture,
( p(X3,X2,X1)
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause6,negated_conjecture,
p(f(g(a)),f(g(b)),f(g(c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause3,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X2,g(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause2,negated_conjecture,
( p(X2,X1,X3)
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause5,negated_conjecture,
~ p(a,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(c_0_6,negated_conjecture,
( p(X1,X2,X3)
| ~ p(f(X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[clause4]) ).
cnf(c_0_7,negated_conjecture,
( p(X3,X2,X1)
| ~ p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause1]) ).
cnf(c_0_8,negated_conjecture,
( p(X1,X2,X3)
| ~ p(f(X1),X2,X3) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
p(f(g(a)),f(g(b)),f(g(c))),
clause6 ).
cnf(c_0_10,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X2,g(X3)) ),
inference(fof_simplification,[status(thm)],[clause3]) ).
cnf(c_0_11,negated_conjecture,
( p(X3,X2,X1)
| ~ p(X1,X2,X3) ),
c_0_7 ).
cnf(c_0_12,negated_conjecture,
p(g(a),f(g(b)),f(g(c))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X2,g(X3)) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
p(f(g(c)),f(g(b)),g(a)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
p(f(g(c)),f(g(b)),a),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
p(g(c),f(g(b)),a),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( p(X2,X1,X3)
| ~ p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause2]) ).
cnf(c_0_18,negated_conjecture,
p(a,f(g(b)),g(c)),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( p(X2,X1,X3)
| ~ p(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_20,negated_conjecture,
p(a,f(g(b)),c),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
p(f(g(b)),a,c),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
p(g(b),a,c),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
p(c,a,g(b)),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
p(c,a,b),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ p(a,b,c),
inference(fof_simplification,[status(thm)],[clause5]) ).
cnf(c_0_26,negated_conjecture,
p(b,a,c),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ p(a,b,c),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYN310-1 : TPTP v8.2.0. Released v1.2.0.
% 0.00/0.07 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n024.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 300
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Mon May 20 15:17:07 EDT 2024
% 0.08/0.26 % CPUTime :
% 0.12/0.33 Running first-order model finding
% 0.12/0.33 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.12/0.34 # Version: 3.1.0
% 0.12/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.34 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.34 # Starting sh5l with 300s (1) cores
% 0.12/0.34 # new_bool_3 with pid 9294 completed with status 0
% 0.12/0.34 # Result found by new_bool_3
% 0.12/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.34 # Search class: FHUNF-FFSF11-SFFFFFNN
% 0.12/0.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.34 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.34 # SAT001_MinMin_p005000_rr_RG with pid 9298 completed with status 0
% 0.12/0.34 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.12/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.34 # Search class: FHUNF-FFSF11-SFFFFFNN
% 0.12/0.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.34 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.34 # Preprocessing time : 0.001 s
% 0.12/0.34 # Presaturation interreduction done
% 0.12/0.34
% 0.12/0.34 # Proof found!
% 0.12/0.34 # SZS status Unsatisfiable
% 0.12/0.34 # SZS output start CNFRefutation
% See solution above
% 0.12/0.34 # Parsed axioms : 6
% 0.12/0.34 # Removed by relevancy pruning/SinE : 0
% 0.12/0.34 # Initial clauses : 6
% 0.12/0.34 # Removed in clause preprocessing : 0
% 0.12/0.34 # Initial clauses in saturation : 6
% 0.12/0.34 # Processed clauses : 25
% 0.12/0.34 # ...of these trivial : 0
% 0.12/0.34 # ...subsumed : 0
% 0.12/0.34 # ...remaining for further processing : 25
% 0.12/0.34 # Other redundant clauses eliminated : 0
% 0.12/0.34 # Clauses deleted for lack of memory : 0
% 0.12/0.34 # Backward-subsumed : 0
% 0.12/0.34 # Backward-rewritten : 0
% 0.12/0.34 # Generated clauses : 36
% 0.12/0.34 # ...of the previous two non-redundant : 28
% 0.12/0.34 # ...aggressively subsumed : 0
% 0.12/0.34 # Contextual simplify-reflections : 0
% 0.12/0.34 # Paramodulations : 36
% 0.12/0.34 # Factorizations : 0
% 0.12/0.34 # NegExts : 0
% 0.12/0.34 # Equation resolutions : 0
% 0.12/0.34 # Disequality decompositions : 0
% 0.12/0.34 # Total rewrite steps : 7
% 0.12/0.34 # ...of those cached : 1
% 0.12/0.34 # Propositional unsat checks : 0
% 0.12/0.34 # Propositional check models : 0
% 0.12/0.34 # Propositional check unsatisfiable : 0
% 0.12/0.34 # Propositional clauses : 0
% 0.12/0.34 # Propositional clauses after purity: 0
% 0.12/0.34 # Propositional unsat core size : 0
% 0.12/0.34 # Propositional preprocessing time : 0.000
% 0.12/0.34 # Propositional encoding time : 0.000
% 0.12/0.34 # Propositional solver time : 0.000
% 0.12/0.34 # Success case prop preproc time : 0.000
% 0.12/0.34 # Success case prop encoding time : 0.000
% 0.12/0.34 # Success case prop solver time : 0.000
% 0.12/0.34 # Current number of processed clauses : 19
% 0.12/0.34 # Positive orientable unit clauses : 14
% 0.12/0.34 # Positive unorientable unit clauses: 0
% 0.12/0.34 # Negative unit clauses : 1
% 0.12/0.34 # Non-unit-clauses : 4
% 0.12/0.34 # Current number of unprocessed clauses: 15
% 0.12/0.34 # ...number of literals in the above : 15
% 0.12/0.34 # Current number of archived formulas : 0
% 0.12/0.34 # Current number of archived clauses : 6
% 0.12/0.34 # Clause-clause subsumption calls (NU) : 12
% 0.12/0.34 # Rec. Clause-clause subsumption calls : 12
% 0.12/0.34 # Non-unit clause-clause subsumptions : 0
% 0.12/0.34 # Unit Clause-clause subsumption calls : 0
% 0.12/0.34 # Rewrite failures with RHS unbound : 0
% 0.12/0.34 # BW rewrite match attempts : 8
% 0.12/0.34 # BW rewrite match successes : 0
% 0.12/0.34 # Condensation attempts : 0
% 0.12/0.34 # Condensation successes : 0
% 0.12/0.34 # Termbank termtop insertions : 513
% 0.12/0.34 # Search garbage collected termcells : 11
% 0.12/0.34
% 0.12/0.34 # -------------------------------------------------
% 0.12/0.34 # User time : 0.001 s
% 0.12/0.34 # System time : 0.002 s
% 0.12/0.34 # Total time : 0.003 s
% 0.12/0.34 # Maximum resident set size: 1620 pages
% 0.12/0.34
% 0.12/0.34 # -------------------------------------------------
% 0.12/0.34 # User time : 0.001 s
% 0.12/0.34 # System time : 0.004 s
% 0.12/0.34 # Total time : 0.005 s
% 0.12/0.34 # Maximum resident set size: 1696 pages
% 0.12/0.34 % E---3.1 exiting
%------------------------------------------------------------------------------