TSTP Solution File: SYN072-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN072-1 : TPTP v8.1.2. Released v1.0.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 10:19:13 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 11 unt; 8 nHn; 18 RR)
% Number of literals : 39 ( 25 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ big_p(e),
file('/export/starexec/sandbox2/tmp/tmp.mY5mBgA3HM/E---3.1_31326.p',prove_this) ).
cnf(clause_1,axiom,
( X1 = c
| X1 = d ),
file('/export/starexec/sandbox2/tmp/tmp.mY5mBgA3HM/E---3.1_31326.p',clause_1) ).
cnf(clause_3,axiom,
big_p(b),
file('/export/starexec/sandbox2/tmp/tmp.mY5mBgA3HM/E---3.1_31326.p',clause_3) ).
cnf(clause_2,axiom,
big_p(a),
file('/export/starexec/sandbox2/tmp/tmp.mY5mBgA3HM/E---3.1_31326.p',clause_2) ).
cnf(clause_4,axiom,
a != b,
file('/export/starexec/sandbox2/tmp/tmp.mY5mBgA3HM/E---3.1_31326.p',clause_4) ).
cnf(c_0_5,negated_conjecture,
~ big_p(e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_6,negated_conjecture,
~ big_p(e),
c_0_5 ).
cnf(c_0_7,axiom,
( X1 = c
| X1 = d ),
clause_1 ).
cnf(c_0_8,negated_conjecture,
( e = c
| ~ big_p(d) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( e = c
| X1 = c
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,axiom,
big_p(b),
clause_3 ).
cnf(c_0_11,negated_conjecture,
( c = b
| e = c ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
big_p(a),
clause_2 ).
cnf(c_0_13,negated_conjecture,
( c = b
| ~ big_p(c) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
( X1 = c
| X2 = c
| X2 = X1 ),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_15,plain,
a != b,
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_16,negated_conjecture,
( c = a
| e = c ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( X1 = c
| X2 = b
| X1 = X2
| ~ big_p(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
a != b,
c_0_15 ).
cnf(c_0_19,negated_conjecture,
( c = a
| ~ big_p(c) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( X1 = a
| X1 = c ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( X1 = a
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 10:47:40 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.mY5mBgA3HM/E---3.1_31326.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31451 completed with status 0
% 0.20/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 31456 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUSF-FFSF00-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 5
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 5
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 5
% 0.20/0.51 # Processed clauses : 36
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 13
% 0.20/0.51 # ...remaining for further processing : 23
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 97
% 0.20/0.51 # ...of the previous two non-redundant : 66
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 69
% 0.20/0.51 # Factorizations : 28
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 17
% 0.20/0.51 # Positive orientable unit clauses : 2
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 13
% 0.20/0.51 # Current number of unprocessed clauses: 40
% 0.20/0.51 # ...number of literals in the above : 142
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 6
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 99
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 87
% 0.20/0.51 # Non-unit clause-clause subsumptions : 14
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 357
% 0.20/0.51 # Search garbage collected termcells : 4
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.002 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.006 s
% 0.20/0.51 # Maximum resident set size: 1592 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.014 s
% 0.20/0.51 # System time : 0.008 s
% 0.20/0.51 # Total time : 0.022 s
% 0.20/0.51 # Maximum resident set size: 1688 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------