TSTP Solution File: SYN070-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN070-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 7 unt; 10 nHn; 25 RR)
% Number of literals : 68 ( 0 equ; 34 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_6,axiom,
( big_g(X1)
| big_g(X2)
| big_j(a,X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_6) ).
cnf(clause_1,axiom,
( big_f(f(X1))
| big_g(X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_1) ).
cnf(clause_3,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(f(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_3) ).
cnf(clause_8,negated_conjecture,
big_f(b),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_8) ).
cnf(clause_9,negated_conjecture,
~ big_g(b),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_9) ).
cnf(clause_4,axiom,
( big_g(X1)
| big_f(a)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_4) ).
cnf(clause_7,axiom,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_7) ).
cnf(clause_2,axiom,
( big_h(f(X1),X1)
| big_g(X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_2) ).
cnf(clause_5,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(a) ),
file('/export/starexec/sandbox2/tmp/tmp.QDhGAb8h5g/E---3.1_21599.p',clause_5) ).
cnf(c_0_9,axiom,
( big_g(X1)
| big_g(X2)
| big_j(a,X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
clause_6 ).
cnf(c_0_10,axiom,
( big_f(f(X1))
| big_g(X1)
| ~ big_f(X1) ),
clause_1 ).
cnf(c_0_11,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(f(X1)) ),
clause_3 ).
cnf(c_0_12,plain,
( big_j(a,f(X1))
| big_g(X1)
| big_g(X2)
| ~ big_f(X2)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
big_f(b),
clause_8 ).
cnf(c_0_14,negated_conjecture,
~ big_g(b),
clause_9 ).
cnf(c_0_15,axiom,
( big_g(X1)
| big_f(a)
| ~ big_f(X1) ),
clause_4 ).
cnf(c_0_16,axiom,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
clause_7 ).
cnf(c_0_17,negated_conjecture,
( big_j(a,f(X1))
| big_g(X1)
| ~ big_f(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
big_f(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
( big_g(X1)
| ~ big_h(f(X1),a)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_10]) ).
cnf(c_0_20,axiom,
( big_h(f(X1),X1)
| big_g(X1)
| ~ big_f(X1) ),
clause_2 ).
cnf(c_0_21,axiom,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(a) ),
clause_5 ).
cnf(c_0_22,negated_conjecture,
big_g(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18])]) ).
cnf(c_0_23,plain,
( big_g(X1)
| ~ big_f(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN070-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 18:09:49 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 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.QDhGAb8h5g/E---3.1_21599.p
% 0.13/0.39 # Version: 3.1pre001
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # sh5l with pid 21717 completed with status 0
% 0.13/0.39 # Result found by sh5l
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.39 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.39 # SAT001_MinMin_p005000_rr_RG with pid 21725 completed with status 0
% 0.13/0.39 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.39 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.39 # Preprocessing time : 0.001 s
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Unsatisfiable
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 9
% 0.13/0.39 # Removed by relevancy pruning/SinE : 0
% 0.13/0.39 # Initial clauses : 9
% 0.13/0.39 # Removed in clause preprocessing : 0
% 0.13/0.39 # Initial clauses in saturation : 9
% 0.13/0.39 # Processed clauses : 30
% 0.13/0.39 # ...of these trivial : 0
% 0.13/0.39 # ...subsumed : 0
% 0.13/0.39 # ...remaining for further processing : 30
% 0.13/0.39 # Other redundant clauses eliminated : 0
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 7
% 0.13/0.39 # Backward-rewritten : 4
% 0.13/0.39 # Generated clauses : 18
% 0.13/0.39 # ...of the previous two non-redundant : 18
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 3
% 0.13/0.39 # Paramodulations : 18
% 0.13/0.39 # Factorizations : 0
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 0
% 0.13/0.39 # Total rewrite steps : 11
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 10
% 0.13/0.39 # Positive orientable unit clauses : 5
% 0.13/0.39 # Positive unorientable unit clauses: 0
% 0.13/0.39 # Negative unit clauses : 3
% 0.13/0.39 # Non-unit-clauses : 2
% 0.13/0.39 # Current number of unprocessed clauses: 0
% 0.13/0.39 # ...number of literals in the above : 0
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 20
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 19
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 15
% 0.13/0.39 # Non-unit clause-clause subsumptions : 10
% 0.13/0.39 # Unit Clause-clause subsumption calls : 2
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 4
% 0.13/0.39 # BW rewrite match successes : 4
% 0.13/0.39 # Condensation attempts : 0
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 576
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.003 s
% 0.13/0.39 # System time : 0.000 s
% 0.13/0.39 # Total time : 0.003 s
% 0.13/0.39 # Maximum resident set size: 1632 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.004 s
% 0.13/0.39 # System time : 0.000 s
% 0.13/0.39 # Total time : 0.005 s
% 0.13/0.39 # Maximum resident set size: 1676 pages
% 0.13/0.39 % E---3.1 exiting
% 0.13/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------