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