TSTP Solution File: SYN032-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN032-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Tue May 21 07:55:53 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 4 unt; 9 nHn; 26 RR)
% Number of literals : 56 ( 0 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 7 ( 6 usr; 7 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(seven,hypothesis,
( c
| ~ h ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',seven) ).
cnf(one,hypothesis,
( ~ h
| ~ c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one) ).
cnf(prove_something,negated_conjecture,
( ~ a
| ~ b ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_something) ).
cnf(six,hypothesis,
( b
| ~ a ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',six) ).
cnf(three,hypothesis,
( h
| a
| ~ j ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',three) ).
cnf(five,hypothesis,
( h
| j
| ~ k ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',five) ).
cnf(four,hypothesis,
( h
| k
| j ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',four) ).
cnf(c_0_7,hypothesis,
( c
| ~ h ),
inference(fof_simplification,[status(thm)],[seven]) ).
cnf(c_0_8,hypothesis,
( ~ h
| ~ c ),
inference(fof_simplification,[status(thm)],[one]) ).
cnf(c_0_9,negated_conjecture,
( ~ a
| ~ b ),
inference(fof_simplification,[status(thm)],[prove_something]) ).
cnf(c_0_10,hypothesis,
( b
| ~ a ),
inference(fof_simplification,[status(thm)],[six]) ).
cnf(c_0_11,hypothesis,
( c
| ~ h ),
c_0_7 ).
cnf(c_0_12,hypothesis,
( ~ h
| ~ c ),
c_0_8 ).
cnf(c_0_13,hypothesis,
( h
| a
| ~ j ),
inference(fof_simplification,[status(thm)],[three]) ).
cnf(c_0_14,negated_conjecture,
( ~ a
| ~ b ),
c_0_9 ).
cnf(c_0_15,hypothesis,
( b
| ~ a ),
c_0_10 ).
cnf(c_0_16,hypothesis,
( h
| j
| ~ k ),
inference(fof_simplification,[status(thm)],[five]) ).
cnf(c_0_17,hypothesis,
( h
| k
| j ),
four ).
cnf(c_0_18,hypothesis,
~ h,
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,hypothesis,
( h
| a
| ~ j ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
~ a,
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,hypothesis,
( h
| j
| ~ k ),
c_0_16 ).
cnf(c_0_22,hypothesis,
( k
| j ),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
( h
| ~ j ),
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
j,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_18]),c_0_22]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN032-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:50:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG 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 # new_bool_3 with pid 4936 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 0.20/0.48 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFSF00-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 4941 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFSF00-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 : 7
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 7
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 7
% 0.20/0.48 # Processed clauses : 7
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 7
% 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 : 2
% 0.20/0.48 # Backward-rewritten : 2
% 0.20/0.48 # Generated clauses : 0
% 0.20/0.48 # ...of the previous two non-redundant : 0
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 3
% 0.20/0.48 # Paramodulations : 0
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 1
% 0.20/0.48 # ...of those cached : 0
% 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 : 3
% 0.20/0.48 # Positive orientable unit clauses : 1
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 0
% 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 : 4
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 3
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 3
% 0.20/0.48 # Non-unit clause-clause subsumptions : 3
% 0.20/0.48 # Unit Clause-clause subsumption calls : 2
% 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 : 126
% 0.20/0.48 # Search garbage collected termcells : 12
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.002 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1640 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.002 s
% 0.20/0.48 # System time : 0.005 s
% 0.20/0.48 # Total time : 0.006 s
% 0.20/0.48 # Maximum resident set size: 1676 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------