TSTP Solution File: PUZ083^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ083^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 02:25:07 EDT 2024
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 48 ( 0 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 91 ( 19 ~; 15 |; 4 &; 48 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 0 ^ 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
peter: $i ).
thf(decl_23,type,
says: $i > $o > $o ).
thf(decl_24,type,
epred1_0: $o ).
thf(ax1,axiom,
( says @ peter
@ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(thm,conjecture,
~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_2,plain,
( ( ~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 )
| ( says @ peter @ $true ) )
& ( ! [X1: $o] :
( ( says @ peter @ X1 )
=> ~ X1 )
| ( says @ peter @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax1])]) ).
thf(c_0_3,negated_conjecture,
~ ~ ! [X1: $o] :
( ( says @ peter @ X1 )
=> X1 ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_4,plain,
! [X4: $o] :
( ( ~ epred1_0
| ( says @ peter @ $true )
| ( says @ peter @ $true ) )
& ( epred1_0
| ( says @ peter @ $false )
| ( says @ peter @ $true ) )
& ( epred1_0
| ( says @ peter @ $true ) )
& ( ~ ( says @ peter @ X4 )
| ~ X4
| ( says @ peter @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X5: $o] :
( ~ ( says @ peter @ X5 )
| X5 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_6,plain,
( ( says @ peter @ $true )
| ( says @ peter @ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
( ( says @ peter @ ~ $true )
| ~ ( says @ peter @ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])]) ).
thf(c_0_8,negated_conjecture,
~ ( says @ peter @ ~ $true ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])]) ).
thf(c_0_9,plain,
( ( says @ peter @ $true )
| ~ epred1_0 ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
~ ( says @ peter @ $true ),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( epred1_0
| ( says @ peter @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,plain,
~ epred1_0,
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11,c_0_10]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ083^1 : TPTP v8.2.0. Released v3.6.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat May 18 10:59:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.45 Running higher-order theorem proving
% 0.16/0.45 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.16/0.46 # Version: 3.1.0-ho
% 0.16/0.46 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.46 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.46 # Starting sh4l with 300s (1) cores
% 0.16/0.46 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.16/0.46 # ho_unfolding_6 with pid 8299 completed with status 0
% 0.16/0.46 # Result found by ho_unfolding_6
% 0.16/0.46 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.46 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.46 # new_ho_10 with pid 8303 completed with status 0
% 0.16/0.46 # Result found by new_ho_10
% 0.16/0.46 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.46 # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: HGUNF-FFSF00-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 4
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 7
% 0.16/0.46 # Removed in clause preprocessing : 2
% 0.16/0.46 # Initial clauses in saturation : 5
% 0.16/0.46 # Processed clauses : 5
% 0.16/0.46 # ...of these trivial : 0
% 0.16/0.46 # ...subsumed : 0
% 0.16/0.46 # ...remaining for further processing : 4
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 0
% 0.16/0.46 # Generated clauses : 1
% 0.16/0.46 # ...of the previous two non-redundant : 1
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 0
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 0
% 0.16/0.46 # ...of those cached : 0
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 3
% 0.16/0.46 # Positive orientable unit clauses : 0
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 3
% 0.16/0.46 # Non-unit-clauses : 0
% 0.16/0.46 # Current number of unprocessed clauses: 1
% 0.16/0.46 # ...number of literals in the above : 3
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 1
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.46 # Non-unit clause-clause subsumptions : 0
% 0.16/0.46 # Unit Clause-clause subsumption calls : 0
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 0
% 0.16/0.46 # BW rewrite match successes : 0
% 0.16/0.46 # Condensation attempts : 5
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 385
% 0.16/0.46 # Search garbage collected termcells : 72
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.003 s
% 0.16/0.46 # System time : 0.001 s
% 0.16/0.46 # Total time : 0.004 s
% 0.16/0.46 # Maximum resident set size: 1604 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.005 s
% 0.16/0.46 # System time : 0.002 s
% 0.16/0.46 # Total time : 0.007 s
% 0.16/0.46 # Maximum resident set size: 1708 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------