TSTP Solution File: SYN077-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN077-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:29:12 EDT 2023
% Result : Unsatisfiable 272.35s 136.54s
% Output : CNFRefutation 272.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 3 unt; 6 nHn; 22 RR)
% Number of literals : 66 ( 5 equ; 40 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( big_f(i(X2,X1),X1)
| big_f(X2,a)
| ~ big_f(X1,h(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_6) ).
cnf(clause_1,axiom,
( X1 = X2
| ~ big_f(X1,f(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_1) ).
cnf(clause_3,negated_conjecture,
( big_f(g(X1,X2),X2)
| ~ big_f(X1,a)
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_3) ).
cnf(clause_7,negated_conjecture,
( big_f(X1,a)
| big_f(i(X1,X2),h(X1))
| ~ big_f(X2,h(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_7) ).
cnf(clause_2,axiom,
( big_f(X1,f(X2))
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_2) ).
cnf(clause_5,negated_conjecture,
( big_f(X1,h(X1))
| big_f(X1,a) ),
file('/export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p',clause_5) ).
cnf(c_0_7,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X3,X2) ),
clause_4 ).
cnf(c_0_8,negated_conjecture,
( big_f(i(X2,X1),X1)
| big_f(X2,a)
| ~ big_f(X1,h(X2)) ),
clause_6 ).
cnf(c_0_9,axiom,
( X1 = X2
| ~ big_f(X1,f(X2)) ),
clause_1 ).
cnf(c_0_10,negated_conjecture,
( big_f(g(X1,X2),X2)
| ~ big_f(X1,a)
| ~ big_f(X1,X2) ),
clause_3 ).
cnf(c_0_11,negated_conjecture,
( big_f(X1,a)
| ~ big_f(i(X1,g(X2,X3)),X3)
| ~ big_f(g(X2,X3),h(X1))
| ~ big_f(X2,a)
| ~ big_f(X2,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( big_f(X1,a)
| big_f(i(X1,X2),h(X1))
| ~ big_f(X2,h(X1)) ),
clause_7 ).
cnf(c_0_13,negated_conjecture,
( g(X1,f(X2)) = X2
| ~ big_f(X1,f(X2))
| ~ big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( big_f(X1,f(X2))
| X1 != X2 ),
clause_2 ).
cnf(c_0_15,negated_conjecture,
( big_f(X1,a)
| ~ big_f(X2,h(X1))
| ~ big_f(X2,a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_f(X1,f(X2))
| ~ big_f(X3,f(X2))
| ~ big_f(X3,a)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,plain,
big_f(X1,f(X1)),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( big_f(X1,a)
| ~ big_f(i(X1,X2),a)
| ~ big_f(X2,h(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_f(X1,f(X2))
| ~ big_f(X1,a)
| ~ big_f(X2,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( big_f(X1,a)
| ~ big_f(a,h(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( big_f(X1,h(X1))
| big_f(X1,a) ),
clause_5 ).
cnf(c_0_22,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
big_f(a,a),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN077-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 18:29:23 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.l6yQ4LmJKs/E---3.1_15913.p
% 272.35/136.54 # Version: 3.1pre001
% 272.35/136.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.35/136.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.35/136.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.35/136.54 # Starting new_bool_3 with 300s (1) cores
% 272.35/136.54 # Starting new_bool_1 with 300s (1) cores
% 272.35/136.54 # Starting sh5l with 300s (1) cores
% 272.35/136.54 # sh5l with pid 15993 completed with status 0
% 272.35/136.54 # Result found by sh5l
% 272.35/136.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.35/136.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.35/136.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.35/136.54 # Starting new_bool_3 with 300s (1) cores
% 272.35/136.54 # Starting new_bool_1 with 300s (1) cores
% 272.35/136.54 # Starting sh5l with 300s (1) cores
% 272.35/136.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.35/136.54 # Search class: FGHSF-FFSF21-SFFFFFNN
% 272.35/136.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.35/136.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.35/136.54 # SAT001_MinMin_p005000_rr_RG with pid 15998 completed with status 0
% 272.35/136.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 272.35/136.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.35/136.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.35/136.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.35/136.54 # Starting new_bool_3 with 300s (1) cores
% 272.35/136.54 # Starting new_bool_1 with 300s (1) cores
% 272.35/136.54 # Starting sh5l with 300s (1) cores
% 272.35/136.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.35/136.54 # Search class: FGHSF-FFSF21-SFFFFFNN
% 272.35/136.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.35/136.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.35/136.54 # Preprocessing time : 0.001 s
% 272.35/136.54 # Presaturation interreduction done
% 272.35/136.54
% 272.35/136.54 # Proof found!
% 272.35/136.54 # SZS status Unsatisfiable
% 272.35/136.54 # SZS output start CNFRefutation
% See solution above
% 272.35/136.54 # Parsed axioms : 7
% 272.35/136.54 # Removed by relevancy pruning/SinE : 0
% 272.35/136.54 # Initial clauses : 7
% 272.35/136.54 # Removed in clause preprocessing : 0
% 272.35/136.54 # Initial clauses in saturation : 7
% 272.35/136.54 # Processed clauses : 40
% 272.35/136.54 # ...of these trivial : 0
% 272.35/136.54 # ...subsumed : 3
% 272.35/136.54 # ...remaining for further processing : 37
% 272.35/136.54 # Other redundant clauses eliminated : 1
% 272.35/136.54 # Clauses deleted for lack of memory : 0
% 272.35/136.54 # Backward-subsumed : 2
% 272.35/136.54 # Backward-rewritten : 0
% 272.35/136.54 # Generated clauses : 41
% 272.35/136.54 # ...of the previous two non-redundant : 37
% 272.35/136.54 # ...aggressively subsumed : 0
% 272.35/136.54 # Contextual simplify-reflections : 1
% 272.35/136.54 # Paramodulations : 40
% 272.35/136.54 # Factorizations : 0
% 272.35/136.54 # NegExts : 0
% 272.35/136.54 # Equation resolutions : 1
% 272.35/136.54 # Total rewrite steps : 3
% 272.35/136.54 # Propositional unsat checks : 0
% 272.35/136.54 # Propositional check models : 0
% 272.35/136.54 # Propositional check unsatisfiable : 0
% 272.35/136.54 # Propositional clauses : 0
% 272.35/136.54 # Propositional clauses after purity: 0
% 272.35/136.54 # Propositional unsat core size : 0
% 272.35/136.54 # Propositional preprocessing time : 0.000
% 272.35/136.54 # Propositional encoding time : 0.000
% 272.35/136.54 # Propositional solver time : 0.000
% 272.35/136.54 # Success case prop preproc time : 0.000
% 272.35/136.54 # Success case prop encoding time : 0.000
% 272.35/136.54 # Success case prop solver time : 0.000
% 272.35/136.54 # Current number of processed clauses : 27
% 272.35/136.54 # Positive orientable unit clauses : 2
% 272.35/136.54 # Positive unorientable unit clauses: 0
% 272.35/136.54 # Negative unit clauses : 0
% 272.35/136.54 # Non-unit-clauses : 25
% 272.35/136.54 # Current number of unprocessed clauses: 11
% 272.35/136.54 # ...number of literals in the above : 36
% 272.35/136.54 # Current number of archived formulas : 0
% 272.35/136.54 # Current number of archived clauses : 9
% 272.35/136.54 # Clause-clause subsumption calls (NU) : 211
% 272.35/136.54 # Rec. Clause-clause subsumption calls : 88
% 272.35/136.54 # Non-unit clause-clause subsumptions : 6
% 272.35/136.54 # Unit Clause-clause subsumption calls : 0
% 272.35/136.54 # Rewrite failures with RHS unbound : 0
% 272.35/136.54 # BW rewrite match attempts : 2
% 272.35/136.54 # BW rewrite match successes : 0
% 272.35/136.54 # Condensation attempts : 0
% 272.35/136.54 # Condensation successes : 0
% 272.35/136.54 # Termbank termtop insertions : 1168
% 272.35/136.54
% 272.35/136.54 # -------------------------------------------------
% 272.35/136.54 # User time : 0.004 s
% 272.35/136.54 # System time : 0.001 s
% 272.35/136.54 # Total time : 0.005 s
% 272.35/136.54 # Maximum resident set size: 1620 pages
% 272.35/136.54
% 272.35/136.54 # -------------------------------------------------
% 272.35/136.54 # User time : 0.005 s
% 272.35/136.54 # System time : 0.003 s
% 272.35/136.54 # Total time : 0.008 s
% 272.35/136.54 # Maximum resident set size: 1676 pages
% 272.35/136.54 % E---3.1 exiting
%------------------------------------------------------------------------------