TSTP Solution File: SYN347-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN347-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:32 EDT 2023
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 24 ( 4 unt; 12 nHn; 18 RR)
% Number of literals : 54 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause2,negated_conjecture,
( f(X2,y(X1,X2))
| f(a,b)
| ~ f(X1,y(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.7BFfNM21Bo/E---3.1_24626.p',clause2) ).
cnf(clause5,negated_conjecture,
( f(a,y(X1,X2))
| f(b,y(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.7BFfNM21Bo/E---3.1_24626.p',clause5) ).
cnf(clause1,negated_conjecture,
( f(X1,y(X1,X2))
| f(a,b)
| ~ f(X2,y(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.7BFfNM21Bo/E---3.1_24626.p',clause1) ).
cnf(clause6,negated_conjecture,
( ~ f(a,y(X1,X2))
| ~ f(b,y(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.7BFfNM21Bo/E---3.1_24626.p',clause6) ).
cnf(clause3,negated_conjecture,
( ~ f(X1,y(X1,X2))
| ~ f(X2,y(X1,X2))
| ~ f(a,b) ),
file('/export/starexec/sandbox/tmp/tmp.7BFfNM21Bo/E---3.1_24626.p',clause3) ).
cnf(clause4,negated_conjecture,
( f(X1,y(X1,X2))
| f(X2,y(X1,X2))
| ~ f(a,b) ),
file('/export/starexec/sandbox/tmp/tmp.7BFfNM21Bo/E---3.1_24626.p',clause4) ).
cnf(c_0_6,negated_conjecture,
( f(X2,y(X1,X2))
| f(a,b)
| ~ f(X1,y(X1,X2)) ),
clause2 ).
cnf(c_0_7,negated_conjecture,
( f(a,y(X1,X2))
| f(b,y(X1,X2)) ),
clause5 ).
cnf(c_0_8,negated_conjecture,
( f(b,y(a,X1))
| f(X1,y(a,X1))
| f(a,b) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( f(X1,y(X1,X2))
| f(a,b)
| ~ f(X2,y(X1,X2)) ),
clause1 ).
cnf(c_0_10,negated_conjecture,
( f(b,y(a,b))
| f(a,b) ),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ f(a,y(X1,X2))
| ~ f(b,y(X1,X2)) ),
clause6 ).
cnf(c_0_12,negated_conjecture,
( f(a,y(a,b))
| f(a,b) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ f(X1,y(X1,X2))
| ~ f(X2,y(X1,X2))
| ~ f(a,b) ),
clause3 ).
cnf(c_0_14,negated_conjecture,
( f(X1,y(X1,X2))
| f(X2,y(X1,X2))
| ~ f(a,b) ),
clause4 ).
cnf(c_0_15,negated_conjecture,
f(a,b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( f(b,y(X1,a))
| ~ f(X1,y(X1,a))
| ~ f(a,b) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( f(X1,y(X2,X1))
| f(X2,y(X2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
( f(b,y(a,a))
| ~ f(a,b) ),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( f(X1,y(a,X1))
| ~ f(b,y(a,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
f(b,y(a,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
( ~ f(X1,y(X2,X1))
| ~ f(X2,y(X2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
f(a,y(a,a)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN347-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 18:54:58 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.7BFfNM21Bo/E---3.1_24626.p
% 0.20/0.48 # Version: 3.1pre001
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_3 with pid 24705 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 24710 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 6
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 6
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 6
% 0.20/0.48 # Processed clauses : 27
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 4
% 0.20/0.48 # ...remaining for further processing : 23
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 8
% 0.20/0.48 # Generated clauses : 28
% 0.20/0.48 # ...of the previous two non-redundant : 21
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 24
% 0.20/0.48 # Factorizations : 4
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Total rewrite steps : 11
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 9
% 0.20/0.48 # Positive orientable unit clauses : 3
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 6
% 0.20/0.48 # Current number of unprocessed clauses: 3
% 0.20/0.48 # ...number of literals in the above : 4
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 14
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 37
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 26
% 0.20/0.48 # Non-unit clause-clause subsumptions : 5
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 1
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 626
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1652 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1672 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------