TSTP Solution File: SYN326-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN326-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:25 EDT 2023
% Result : Unsatisfiable 0.32s 0.52s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 5 unt; 2 nHn; 8 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 10 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause3,negated_conjecture,
( f(X1,X1)
| ~ h(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UZJkSQ5mYa/E---3.1_17611.p',clause3) ).
cnf(clause5,negated_conjecture,
( h(z(X1))
| ~ g(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UZJkSQ5mYa/E---3.1_17611.p',clause5) ).
cnf(clause7,negated_conjecture,
~ f(z(X1),z(X1)),
file('/export/starexec/sandbox2/tmp/tmp.UZJkSQ5mYa/E---3.1_17611.p',clause7) ).
cnf(clause2,negated_conjecture,
( g(y(X1))
| f(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.UZJkSQ5mYa/E---3.1_17611.p',clause2) ).
cnf(c_0_4,negated_conjecture,
( f(X1,X1)
| ~ h(X1) ),
clause3 ).
cnf(c_0_5,negated_conjecture,
( h(z(X1))
| ~ g(X1) ),
clause5 ).
cnf(c_0_6,negated_conjecture,
~ f(z(X1),z(X1)),
clause7 ).
cnf(c_0_7,negated_conjecture,
( g(y(X1))
| f(X1,X1) ),
clause2 ).
cnf(c_0_8,negated_conjecture,
~ g(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
f(X1,X1),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SYN326-1 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.13/0.37 % Computer : n017.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 2400
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Oct 2 18:08:26 EDT 2023
% 0.13/0.38 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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.UZJkSQ5mYa/E---3.1_17611.p
% 0.32/0.52 # Version: 3.1pre001
% 0.32/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.32/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.32/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.32/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.32/0.52 # Starting sh5l with 300s (1) cores
% 0.32/0.52 # new_bool_3 with pid 17692 completed with status 0
% 0.32/0.52 # Result found by new_bool_3
% 0.32/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.32/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.32/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.32/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.52 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.32/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.52 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.32/0.52 # SAT001_CO_MinMin_p005000_rr with pid 17697 completed with status 0
% 0.32/0.52 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.32/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.32/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.32/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.32/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.52 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.32/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.52 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.32/0.52 # Preprocessing time : 0.001 s
% 0.32/0.52 # Presaturation interreduction done
% 0.32/0.52
% 0.32/0.52 # Proof found!
% 0.32/0.52 # SZS status Unsatisfiable
% 0.32/0.52 # SZS output start CNFRefutation
% See solution above
% 0.32/0.52 # Parsed axioms : 7
% 0.32/0.52 # Removed by relevancy pruning/SinE : 0
% 0.32/0.52 # Initial clauses : 7
% 0.32/0.52 # Removed in clause preprocessing : 0
% 0.32/0.52 # Initial clauses in saturation : 7
% 0.32/0.52 # Processed clauses : 13
% 0.32/0.52 # ...of these trivial : 0
% 0.32/0.52 # ...subsumed : 0
% 0.32/0.52 # ...remaining for further processing : 13
% 0.32/0.52 # Other redundant clauses eliminated : 0
% 0.32/0.52 # Clauses deleted for lack of memory : 0
% 0.32/0.52 # Backward-subsumed : 1
% 0.32/0.52 # Backward-rewritten : 2
% 0.32/0.52 # Generated clauses : 1
% 0.32/0.52 # ...of the previous two non-redundant : 1
% 0.32/0.52 # ...aggressively subsumed : 0
% 0.32/0.52 # Contextual simplify-reflections : 0
% 0.32/0.52 # Paramodulations : 1
% 0.32/0.52 # Factorizations : 0
% 0.32/0.52 # NegExts : 0
% 0.32/0.52 # Equation resolutions : 0
% 0.32/0.52 # Total rewrite steps : 2
% 0.32/0.52 # Propositional unsat checks : 0
% 0.32/0.52 # Propositional check models : 0
% 0.32/0.52 # Propositional check unsatisfiable : 0
% 0.32/0.52 # Propositional clauses : 0
% 0.32/0.52 # Propositional clauses after purity: 0
% 0.32/0.52 # Propositional unsat core size : 0
% 0.32/0.52 # Propositional preprocessing time : 0.000
% 0.32/0.52 # Propositional encoding time : 0.000
% 0.32/0.52 # Propositional solver time : 0.000
% 0.32/0.52 # Success case prop preproc time : 0.000
% 0.32/0.52 # Success case prop encoding time : 0.000
% 0.32/0.52 # Success case prop solver time : 0.000
% 0.32/0.52 # Current number of processed clauses : 3
% 0.32/0.52 # Positive orientable unit clauses : 2
% 0.32/0.52 # Positive unorientable unit clauses: 0
% 0.32/0.52 # Negative unit clauses : 1
% 0.32/0.52 # Non-unit-clauses : 0
% 0.32/0.52 # Current number of unprocessed clauses: 2
% 0.32/0.52 # ...number of literals in the above : 4
% 0.32/0.52 # Current number of archived formulas : 0
% 0.32/0.52 # Current number of archived clauses : 10
% 0.32/0.52 # Clause-clause subsumption calls (NU) : 1
% 0.32/0.52 # Rec. Clause-clause subsumption calls : 1
% 0.32/0.52 # Non-unit clause-clause subsumptions : 0
% 0.32/0.52 # Unit Clause-clause subsumption calls : 1
% 0.32/0.52 # Rewrite failures with RHS unbound : 0
% 0.32/0.52 # BW rewrite match attempts : 3
% 0.32/0.52 # BW rewrite match successes : 2
% 0.32/0.52 # Condensation attempts : 14
% 0.32/0.52 # Condensation successes : 0
% 0.32/0.52 # Termbank termtop insertions : 171
% 0.32/0.52
% 0.32/0.52 # -------------------------------------------------
% 0.32/0.52 # User time : 0.000 s
% 0.32/0.52 # System time : 0.003 s
% 0.32/0.52 # Total time : 0.003 s
% 0.32/0.52 # Maximum resident set size: 1648 pages
% 0.32/0.52
% 0.32/0.52 # -------------------------------------------------
% 0.32/0.52 # User time : 0.000 s
% 0.32/0.52 # System time : 0.006 s
% 0.32/0.52 # Total time : 0.006 s
% 0.32/0.52 # Maximum resident set size: 1672 pages
% 0.32/0.52 % E---3.1 exiting
% 0.32/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------