TSTP Solution File: SYN006-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN006-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Sat May 4 10:04:47 EDT 2024
% Result : Unsatisfiable 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 14 unt; 6 nHn; 24 RR)
% Number of literals : 44 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,negated_conjecture,
~ q3(X1,g(X2)),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_5) ).
cnf(clause_4,negated_conjecture,
( q3(f(X1),X2)
| q4(X1,f(X2))
| ~ p2(X1,f(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_4) ).
cnf(clause_1,negated_conjecture,
( q1(f(X1),X2)
| q2(X1,f(X2))
| ~ p1(X1,f(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_1) ).
cnf(clause_3,negated_conjecture,
~ q2(X1,f(X2)),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_3) ).
cnf(clause_6,negated_conjecture,
~ q4(f(f(X1)),f(g(f(X2)))),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( p2(f(X1),X2)
| ~ q1(X1,f(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_7) ).
cnf(clause_2,negated_conjecture,
p1(a,X1),
file('/export/starexec/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p',clause_2) ).
cnf(c_0_7,negated_conjecture,
~ q3(X1,g(X2)),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_8,negated_conjecture,
( q3(f(X1),X2)
| q4(X1,f(X2))
| ~ p2(X1,f(X2)) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_9,negated_conjecture,
( q1(f(X1),X2)
| q2(X1,f(X2))
| ~ p1(X1,f(X2)) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_10,negated_conjecture,
~ q2(X1,f(X2)),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_11,negated_conjecture,
~ q4(f(f(X1)),f(g(f(X2)))),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_12,negated_conjecture,
~ q3(X1,g(X2)),
c_0_7 ).
cnf(c_0_13,negated_conjecture,
( q3(f(X1),X2)
| q4(X1,f(X2))
| ~ p2(X1,f(X2)) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
( p2(f(X1),X2)
| ~ q1(X1,f(X2)) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_15,negated_conjecture,
( q1(f(X1),X2)
| q2(X1,f(X2))
| ~ p1(X1,f(X2)) ),
c_0_9 ).
cnf(c_0_16,negated_conjecture,
~ q2(X1,f(X2)),
c_0_10 ).
cnf(c_0_17,negated_conjecture,
~ q4(f(f(X1)),f(g(f(X2)))),
c_0_11 ).
cnf(c_0_18,negated_conjecture,
( q4(X1,f(g(X2)))
| ~ p2(X1,f(g(X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( p2(f(X1),X2)
| ~ q1(X1,f(X2)) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( q1(f(X1),X2)
| ~ p1(X1,f(X2)) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ p2(f(f(X1)),f(g(f(X2)))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( p2(f(f(X1)),X2)
| ~ p1(X1,f(f(X2))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ p1(X1,f(f(f(g(f(X2)))))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
p1(a,X1),
clause_2 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n003.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 11:46:35 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ExsWIYTp93/E---3.1_9553.p
% 0.16/0.43 # Version: 3.1.0
% 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 9635 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: FGUNF-FFSF11-MFFFFFNN
% 0.16/0.43 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.16/0.43 # SAT001_CO_MinMin_p005000_rr with pid 9640 completed with status 0
% 0.16/0.43 # Result found by SAT001_CO_MinMin_p005000_rr
% 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: FGUNF-FFSF11-MFFFFFNN
% 0.16/0.43 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_CO_MinMin_p005000_rr 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 : 7
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 7
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 7
% 0.16/0.43 # Processed clauses : 18
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 18
% 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 : 5
% 0.16/0.43 # ...of the previous two non-redundant : 4
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 5
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 0
% 0.16/0.43 # ...of those cached : 0
% 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 : 11
% 0.16/0.43 # Positive orientable unit clauses : 1
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 5
% 0.16/0.43 # Non-unit-clauses : 5
% 0.16/0.43 # Current number of unprocessed clauses: 0
% 0.16/0.43 # ...number of literals in the above : 0
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 7
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 1
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 0
% 0.16/0.43 # BW rewrite match successes : 0
% 0.16/0.43 # Condensation attempts : 18
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 329
% 0.16/0.43 # Search garbage collected termcells : 14
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.001 s
% 0.16/0.43 # System time : 0.003 s
% 0.16/0.43 # Total time : 0.003 s
% 0.16/0.43 # Maximum resident set size: 1600 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.001 s
% 0.16/0.43 # System time : 0.005 s
% 0.16/0.43 # Total time : 0.006 s
% 0.16/0.43 # Maximum resident set size: 1692 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------