TSTP Solution File: SYO368^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO368^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:45 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 61 ( 0 equ; 0 cnn)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 70 ( 21 ~; 18 |; 11 &; 16 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
b: $o ).
thf(decl_23,type,
cP: $o > $o ).
thf(decl_24,type,
a: $o ).
thf(cTRIVEXT1,conjecture,
( ( ( a
<=> b )
& ( cP @ a ) )
=> ( cP @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIVEXT1) ).
thf(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])]) ).
thf(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])])]) ).
thf(c_0_3,negated_conjecture,
( ~ b
| ~ ( cP @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( cP @ $true )
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( b
| ~ ( cP @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( a
| ( cP @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
~ b,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
( b
| ~ a ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
a,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO368^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 09:37:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49 # Starting sh4l with 300s (1) cores
% 0.20/0.49 # ehoh_best8_lambda with pid 5535 completed with status 0
% 0.20/0.49 # Result found by ehoh_best8_lambda
% 0.20/0.49 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # new_ho_10 with pid 5539 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSLSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNF-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 4
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 11
% 0.20/0.49 # Removed in clause preprocessing : 4
% 0.20/0.49 # Initial clauses in saturation : 7
% 0.20/0.49 # Processed clauses : 16
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 16
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 4
% 0.20/0.49 # ...of the previous two non-redundant : 4
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 4
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 3
% 0.20/0.49 # ...of those cached : 2
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 4
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 2
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 2
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 12
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 2
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 16
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 445
% 0.20/0.49 # Search garbage collected termcells : 75
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.002 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1584 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1696 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------