TSTP Solution File: SYN312-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 20:14:21 EDT 2023
% Result : Unsatisfiable 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 28 RR)
% Number of literals : 43 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause8,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause8) ).
cnf(clause4,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause4) ).
cnf(clause2,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause2) ).
cnf(clause5,negated_conjecture,
( p(g(X1),X2,X3)
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause5) ).
cnf(clause3,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause3) ).
cnf(clause1,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X4,X3)
| ~ p(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause1) ).
cnf(clause7,negated_conjecture,
p(f(b),d,c),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause7) ).
cnf(clause6,negated_conjecture,
p(a,f(b),c),
file('/export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p',clause6) ).
cnf(c_0_8,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
clause8 ).
cnf(c_0_9,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X1,X2,X3) ),
clause4 ).
cnf(c_0_10,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X3,X2,X1) ),
clause2 ).
cnf(c_0_11,negated_conjecture,
( p(g(X1),X2,X3)
| ~ p(X1,X2,X3) ),
clause5 ).
cnf(c_0_12,negated_conjecture,
~ p(f(g(a)),f(g(d)),g(c)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( p(X1,X2,g(X3))
| ~ p(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X2,X1,X3) ),
clause3 ).
cnf(c_0_15,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X4,X3)
| ~ p(X4,X2,X3) ),
clause1 ).
cnf(c_0_16,negated_conjecture,
p(f(b),d,c),
clause7 ).
cnf(c_0_17,negated_conjecture,
~ p(c,f(g(d)),f(g(a))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( p(X1,d,c)
| ~ p(X1,f(b),c) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
p(a,f(b),c),
clause6 ).
cnf(c_0_21,negated_conjecture,
~ p(f(g(d)),c,g(a)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
p(a,d,c),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ p(a,c,f(g(d))),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
p(c,d,a),
inference(spm,[status(thm)],[c_0_10,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ p(a,c,g(d)),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_26,negated_conjecture,
p(d,c,a),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 18:05:36 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.GJVOzuEEp4/E---3.1_8967.p
% 0.16/0.43 # Version: 3.1pre001
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 9046 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FHUNF-FFSF11-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # SAT001_MinMin_p005000_rr_RG with pid 9050 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FHUNF-FFSF11-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Unsatisfiable
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 8
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 8
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 8
% 0.16/0.43 # Processed clauses : 65
% 0.16/0.43 # ...of these trivial : 3
% 0.16/0.43 # ...subsumed : 3
% 0.16/0.43 # ...remaining for further processing : 59
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 0
% 0.16/0.43 # Generated clauses : 115
% 0.16/0.43 # ...of the previous two non-redundant : 89
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 115
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Total rewrite steps : 28
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 51
% 0.16/0.43 # Positive orientable unit clauses : 21
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 19
% 0.16/0.43 # Non-unit-clauses : 11
% 0.16/0.43 # Current number of unprocessed clauses: 40
% 0.16/0.43 # ...number of literals in the above : 82
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 8
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 48
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 48
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 144
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 10
% 0.16/0.43 # BW rewrite match successes : 0
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 1041
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.004 s
% 0.16/0.43 # System time : 0.001 s
% 0.16/0.43 # Total time : 0.004 s
% 0.16/0.43 # Maximum resident set size: 1636 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.005 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.007 s
% 0.16/0.43 # Maximum resident set size: 1672 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------