TSTP Solution File: SYN055-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN055-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:06:01 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 6 unt; 6 nHn; 27 RR)
% Number of literals : 57 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,axiom,
( big_q(X1)
| big_p(b)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_5) ).
cnf(clause_7,negated_conjecture,
( ~ big_q(X1)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_7) ).
cnf(clause_6,negated_conjecture,
( big_q(X1)
| big_r(b)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_6) ).
cnf(clause_1,axiom,
big_p(a),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_1) ).
cnf(clause_2,axiom,
( ~ big_f(X1)
| ~ big_g(X1)
| ~ big_r(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_2) ).
cnf(clause_4,axiom,
( big_g(X1)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_4) ).
cnf(clause_3,axiom,
( big_f(X1)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fybef44aSl/E---3.1_27797.p',clause_3) ).
cnf(c_0_7,plain,
( big_q(X1)
| big_p(b)
| ~ big_p(X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_q(X1)
| ~ big_p(X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_9,negated_conjecture,
( big_q(X1)
| big_r(b)
| ~ big_p(X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_10,plain,
( big_q(X1)
| big_p(b)
| ~ big_p(X1) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( ~ big_q(X1)
| ~ big_p(X1) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
( big_q(X1)
| big_r(b)
| ~ big_p(X1) ),
c_0_9 ).
cnf(c_0_13,plain,
( big_p(b)
| ~ big_p(X1) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
big_p(a),
clause_1 ).
cnf(c_0_15,plain,
( ~ big_f(X1)
| ~ big_g(X1)
| ~ big_r(X1) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_16,negated_conjecture,
( big_r(b)
| ~ big_p(X1) ),
inference(csr,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,plain,
big_p(b),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ big_f(X1)
| ~ big_g(X1)
| ~ big_r(X1) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
big_r(b),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( big_g(X1)
| ~ big_p(X1) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_21,negated_conjecture,
( ~ big_g(b)
| ~ big_f(b) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( big_g(X1)
| ~ big_p(X1) ),
c_0_20 ).
cnf(c_0_23,plain,
( big_f(X1)
| ~ big_p(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_24,negated_conjecture,
~ big_f(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).
cnf(c_0_25,plain,
( big_f(X1)
| ~ big_p(X1) ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN055-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:54:40 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.fybef44aSl/E---3.1_27797.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27915 completed with status 0
% 0.21/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 27919 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 7
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 7
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 7
% 0.21/0.50 # Processed clauses : 18
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 18
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 1
% 0.21/0.50 # Backward-rewritten : 2
% 0.21/0.50 # Generated clauses : 6
% 0.21/0.50 # ...of the previous two non-redundant : 5
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 6
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 4
% 0.21/0.50 # ...of those cached : 2
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 8
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 4
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 10
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 3
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.21/0.50 # Non-unit clause-clause subsumptions : 2
% 0.21/0.50 # Unit Clause-clause subsumption calls : 2
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 2
% 0.21/0.50 # BW rewrite match successes : 2
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 241
% 0.21/0.50 # Search garbage collected termcells : 14
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1592 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.016 s
% 0.21/0.50 # Maximum resident set size: 1688 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------