TSTP Solution File: SYO368_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO368_8 : TPTP v8.2.0. Released v8.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 08:45:46 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 52 ( 19 ~; 18 |; 11 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
b: $o ).
tff(decl_23,type,
cP: $o > $o ).
tff(decl_24,type,
a: $o ).
fof(cTRIVEXT1,conjecture,
( ( ( a
<=> b )
& cP(a) )
=> cP(b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIVEXT1) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( a
<=> b )
& ( ~ a
| cP($true) )
& ( a
| cP($false) ) )
=> ( ( ~ b
| cP($true) )
& ( b
| cP($false) ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[cTRIVEXT1])]) ).
fof(c_0_2,negated_conjecture,
( ( ~ a
| b )
& ( ~ b
| a )
& ( ~ a
| cP($true) )
& ( a
| cP($false) )
& ( ~ b
| b )
& ( ~ cP($false)
| b )
& ( ~ b
| ~ cP($true) )
& ( ~ cP($false)
| ~ cP($true) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3,negated_conjecture,
( b
| ~ cP($false) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( a
| cP($false) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( b
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
a,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ b
| ~ cP($true) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
( cP($true)
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
~ cP($true),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SYO368_8 : TPTP v8.2.0. Released v8.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 09:35:52 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 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/benchmark/theBenchmark.p
% 0.15/0.40 # Version: 3.1.0
% 0.15/0.40 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # new_bool_3 with pid 21644 completed with status 0
% 0.15/0.40 # Result found by new_bool_3
% 0.15/0.40 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.40 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.40 # SAT001_MinMin_p005000_rr_RG with pid 21647 completed with status 0
% 0.15/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.40 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.40 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Theorem
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 4
% 0.15/0.40 # Removed by relevancy pruning/SinE : 3
% 0.15/0.40 # Initial clauses : 8
% 0.15/0.40 # Removed in clause preprocessing : 1
% 0.15/0.40 # Initial clauses in saturation : 7
% 0.15/0.40 # Processed clauses : 17
% 0.15/0.40 # ...of these trivial : 0
% 0.15/0.40 # ...subsumed : 1
% 0.15/0.40 # ...remaining for further processing : 15
% 0.15/0.40 # Other redundant clauses eliminated : 0
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 1
% 0.15/0.40 # Backward-rewritten : 4
% 0.15/0.40 # Generated clauses : 2
% 0.15/0.40 # ...of the previous two non-redundant : 3
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 1
% 0.15/0.40 # Paramodulations : 2
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 0
% 0.15/0.40 # Disequality decompositions : 0
% 0.15/0.40 # Total rewrite steps : 5
% 0.15/0.40 # ...of those cached : 3
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 3
% 0.15/0.40 # Positive orientable unit clauses : 2
% 0.15/0.40 # Positive unorientable unit clauses: 0
% 0.15/0.40 # Negative unit clauses : 1
% 0.15/0.40 # Non-unit-clauses : 0
% 0.15/0.40 # Current number of unprocessed clauses: 0
% 0.15/0.40 # ...number of literals in the above : 0
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 12
% 0.15/0.40 # Clause-clause subsumption calls (NU) : 1
% 0.15/0.40 # Rec. Clause-clause subsumption calls : 1
% 0.15/0.40 # Non-unit clause-clause subsumptions : 1
% 0.15/0.40 # Unit Clause-clause subsumption calls : 1
% 0.15/0.40 # Rewrite failures with RHS unbound : 0
% 0.15/0.40 # BW rewrite match attempts : 2
% 0.15/0.40 # BW rewrite match successes : 2
% 0.15/0.40 # Condensation attempts : 0
% 0.15/0.40 # Condensation successes : 0
% 0.15/0.40 # Termbank termtop insertions : 347
% 0.15/0.40 # Search garbage collected termcells : 75
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.003 s
% 0.15/0.40 # System time : 0.000 s
% 0.15/0.40 # Total time : 0.003 s
% 0.15/0.40 # Maximum resident set size: 1584 pages
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.003 s
% 0.15/0.40 # System time : 0.002 s
% 0.15/0.40 # Total time : 0.004 s
% 0.15/0.40 # Maximum resident set size: 1684 pages
% 0.15/0.40 % E---3.1 exiting
% 0.15/0.40 % E exiting
%------------------------------------------------------------------------------