TSTP Solution File: SYN069-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN069-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:13:40 EDT 2023
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 5 unt; 7 nHn; 29 RR)
% Number of literals : 77 ( 0 equ; 46 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,axiom,
( ~ big_l(X1)
| ~ big_k(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_4) ).
cnf(clause_6,axiom,
( big_l(X1)
| ~ big_h(a,X1) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_6) ).
cnf(clause_1,axiom,
( big_g(f(X1))
| big_k(X2)
| ~ big_f(X1)
| ~ big_g(X2)
| ~ big_h(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_1) ).
cnf(clause_9,negated_conjecture,
( big_h(X1,g(X1))
| ~ big_f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_9) ).
cnf(clause_8,negated_conjecture,
( big_g(g(X1))
| ~ big_f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_8) ).
cnf(clause_2,axiom,
( big_h(X1,f(X1))
| big_k(X2)
| ~ big_f(X1)
| ~ big_g(X2)
| ~ big_h(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_2) ).
cnf(clause_5,axiom,
big_f(a),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_5) ).
cnf(clause_3,axiom,
( big_k(X2)
| ~ big_f(X1)
| ~ big_j(X1,f(X1))
| ~ big_g(X2)
| ~ big_h(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_3) ).
cnf(clause_7,axiom,
( big_j(a,X1)
| ~ big_g(X1)
| ~ big_h(a,X1) ),
file('/export/starexec/sandbox/tmp/tmp.qBfylHwtaF/E---3.1_7918.p',clause_7) ).
cnf(c_0_9,axiom,
( ~ big_l(X1)
| ~ big_k(X1) ),
clause_4 ).
cnf(c_0_10,axiom,
( big_l(X1)
| ~ big_h(a,X1) ),
clause_6 ).
cnf(c_0_11,axiom,
( big_g(f(X1))
| big_k(X2)
| ~ big_f(X1)
| ~ big_g(X2)
| ~ big_h(X1,X2) ),
clause_1 ).
cnf(c_0_12,negated_conjecture,
( big_h(X1,g(X1))
| ~ big_f(X1) ),
clause_9 ).
cnf(c_0_13,negated_conjecture,
( big_g(g(X1))
| ~ big_f(X1) ),
clause_8 ).
cnf(c_0_14,axiom,
( big_h(X1,f(X1))
| big_k(X2)
| ~ big_f(X1)
| ~ big_g(X2)
| ~ big_h(X1,X2) ),
clause_2 ).
cnf(c_0_15,plain,
( ~ big_k(X1)
| ~ big_h(a,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( big_k(g(X1))
| big_g(f(X1))
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( big_k(g(X1))
| big_h(X1,f(X1))
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).
cnf(c_0_18,axiom,
big_f(a),
clause_5 ).
cnf(c_0_19,negated_conjecture,
( big_g(f(X1))
| ~ big_h(a,g(X1))
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( big_k(g(a))
| big_h(a,f(a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( big_k(X2)
| ~ big_f(X1)
| ~ big_j(X1,f(X1))
| ~ big_g(X2)
| ~ big_h(X1,X2) ),
clause_3 ).
cnf(c_0_22,axiom,
( big_j(a,X1)
| ~ big_g(X1)
| ~ big_h(a,X1) ),
clause_7 ).
cnf(c_0_23,negated_conjecture,
big_g(f(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
( big_h(a,f(a))
| ~ big_h(a,g(a)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_25,plain,
( ~ big_h(a,f(a))
| ~ big_h(a,X1)
| ~ big_g(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_23])]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
big_h(a,f(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_18])]) ).
cnf(c_0_27,plain,
( ~ big_h(a,X1)
| ~ big_g(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN069-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 18:45:30 EDT 2023
% 0.13/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.qBfylHwtaF/E---3.1_7918.p
% 0.20/0.48 # Version: 3.1pre001
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # sh5l with pid 7999 completed with status 0
% 0.20/0.48 # Result found by sh5l
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: FGHNF-FFSF11-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 8006 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: FGHNF-FFSF11-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 : 9
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 9
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 9
% 0.20/0.48 # Processed clauses : 28
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 28
% 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 : 1
% 0.20/0.48 # Backward-rewritten : 3
% 0.20/0.48 # Generated clauses : 13
% 0.20/0.48 # ...of the previous two non-redundant : 11
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 3
% 0.20/0.48 # Paramodulations : 13
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Total rewrite steps : 14
% 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 : 15
% 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 : 12
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 13
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 81
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 35
% 0.20/0.48 # Non-unit clause-clause subsumptions : 4
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 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 : 555
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1668 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.005 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1676 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------