TSTP Solution File: SYO043^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO043^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:44:23 EDT 2024
% Result : Unsatisfiable 0.10s 0.34s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 3 unt; 4 typ; 0 def)
% Number of atoms : 432 ( 0 equ; 0 cnn)
% Maximal formula atoms : 233 ( 16 avg)
% Number of connectives : 520 ( 115 ~; 169 |; 51 &; 182 @)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
f: $o > $o ).
thf(decl_23,type,
q: ( $o > $o ) > $o > $o ).
thf(decl_24,type,
x: $o ).
thf(decl_25,type,
epred1_0: $o ).
thf(5,axiom,
( ( q @ f @ x )
& ( f @ ( f @ x ) )
& ( ( f @ ( q @ f @ x ) )
<~> ( f @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',5) ).
thf(c_0_1,plain,
( epred1_0
<=> ( ( ( ( ~ x
| ~ ( q @ f @ $true ) )
& ( x
| ~ ( q @ f @ $false ) ) )
| ( f @ $true ) )
& ( ( ( ~ x
| ( q @ f @ $true ) )
& ( x
| ( q @ f @ $false ) ) )
| ( f @ $false ) ) ) ),
introduced(definition) ).
thf(c_0_2,plain,
( ( ~ x
| ( q @ f @ $true ) )
& ( x
| ( q @ f @ $false ) )
& ( ( ( ~ x
| ~ ( f @ $true ) )
& ( x
| ~ ( f @ $false ) ) )
| ( f @ $true ) )
& ( ( ( ~ x
| ( f @ $true ) )
& ( x
| ( f @ $false ) ) )
| ( f @ $false ) )
& ~ ( epred1_0
<=> ( ( ~ x
| ( f @ $true ) )
& ( x
| ( f @ $false ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[5])]),c_0_1]) ).
thf(c_0_3,plain,
( ( ~ x
| ( q @ f @ $true ) )
& ( x
| ( q @ f @ $false ) )
& ( ~ x
| ~ ( f @ $true )
| ( f @ $true ) )
& ( x
| ~ ( f @ $false )
| ( f @ $true ) )
& ( ~ x
| ( f @ $true )
| ( f @ $false ) )
& ( x
| ( f @ $false )
| ( f @ $false ) )
& ( ~ x
| x
| ~ epred1_0 )
& ( ~ ( f @ $false )
| x
| ~ epred1_0 )
& ( ~ x
| ~ ( f @ $true )
| ~ epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| ~ epred1_0 )
& ( ~ x
| ( f @ $true )
| epred1_0 )
& ( x
| ( f @ $false )
| epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_4,plain,
( x
| ( f @ ~ $true )
| ( f @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
( ( f @ $true )
| ( f @ ~ $true )
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
( x
| ( f @ ~ $true ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
( ( ~ x
| ~ ( q @ f @ $true )
| ( f @ $true )
| ~ epred1_0 )
& ( x
| ~ ( q @ f @ $false )
| ( f @ $true )
| ~ epred1_0 )
& ( ~ x
| ( q @ f @ $true )
| ( f @ $false )
| ~ epred1_0 )
& ( x
| ( q @ f @ $false )
| ( f @ $false )
| ~ epred1_0 )
& ( ~ x
| x
| ~ x
| x
| epred1_0 )
& ( ~ ( q @ f @ $false )
| x
| ~ x
| x
| epred1_0 )
& ( ~ x
| ~ ( q @ f @ $true )
| ~ x
| x
| epred1_0 )
& ( ~ ( q @ f @ $false )
| ~ ( q @ f @ $true )
| ~ x
| x
| epred1_0 )
& ( ~ ( f @ $false )
| ~ x
| x
| epred1_0 )
& ( ~ x
| x
| ( q @ f @ $false )
| x
| epred1_0 )
& ( ~ ( q @ f @ $false )
| x
| ( q @ f @ $false )
| x
| epred1_0 )
& ( ~ x
| ~ ( q @ f @ $true )
| ( q @ f @ $false )
| x
| epred1_0 )
& ( ~ ( q @ f @ $false )
| ~ ( q @ f @ $true )
| ( q @ f @ $false )
| x
| epred1_0 )
& ( ~ ( f @ $false )
| ( q @ f @ $false )
| x
| epred1_0 )
& ( ~ x
| x
| ~ x
| ( q @ f @ $true )
| epred1_0 )
& ( ~ ( q @ f @ $false )
| x
| ~ x
| ( q @ f @ $true )
| epred1_0 )
& ( ~ x
| ~ ( q @ f @ $true )
| ~ x
| ( q @ f @ $true )
| epred1_0 )
& ( ~ ( q @ f @ $false )
| ~ ( q @ f @ $true )
| ~ x
| ( q @ f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| ~ x
| ( q @ f @ $true )
| epred1_0 )
& ( ~ x
| x
| ( q @ f @ $false )
| ( q @ f @ $true )
| epred1_0 )
& ( ~ ( q @ f @ $false )
| x
| ( q @ f @ $false )
| ( q @ f @ $true )
| epred1_0 )
& ( ~ x
| ~ ( q @ f @ $true )
| ( q @ f @ $false )
| ( q @ f @ $true )
| epred1_0 )
& ( ~ ( q @ f @ $false )
| ~ ( q @ f @ $true )
| ( q @ f @ $false )
| ( q @ f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| ( q @ f @ $false )
| ( q @ f @ $true )
| epred1_0 )
& ( ~ x
| x
| ~ ( f @ $true )
| epred1_0 )
& ( ~ ( q @ f @ $false )
| x
| ~ ( f @ $true )
| epred1_0 )
& ( ~ x
| ~ ( q @ f @ $true )
| ~ ( f @ $true )
| epred1_0 )
& ( ~ ( q @ f @ $false )
| ~ ( q @ f @ $true )
| ~ ( f @ $true )
| epred1_0 )
& ( ~ ( f @ $false )
| ~ ( f @ $true )
| epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_8,plain,
( x
| ( f @ $true )
| ~ ( f @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,plain,
( ( f @ ~ $true )
| ( f @ $true ) ),
inference(csr,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,plain,
( x
| ~ ( f @ ~ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,plain,
( epred1_0
| ~ x
| ~ ( q @ f @ $true )
| ~ ( f @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
( ( f @ $true )
| epred1_0
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,plain,
( ( q @ f @ $true )
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,plain,
( x
| epred1_0
| ~ ( q @ f @ ~ $true )
| ~ ( f @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,plain,
( ( f @ $true )
| x ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_16,plain,
( x
| ( q @ f @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,plain,
( x
| ~ epred1_0 ),
inference(csr,[status(thm)],[c_0_10,c_0_6]) ).
thf(c_0_18,plain,
( epred1_0
| ~ x ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_19,plain,
x,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).
thf(c_0_20,plain,
( ( f @ $true )
| ~ x
| ~ ( q @ f @ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_21,plain,
( ~ x
| ~ ( f @ $true )
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_22,plain,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_23,plain,
( ( f @ $true )
| ~ ( q @ f @ $true ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_18]),c_0_15]) ).
thf(c_0_24,plain,
q @ f @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_19])]) ).
thf(c_0_25,plain,
~ ( f @ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19])]),c_0_22])]) ).
thf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYO043^1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.07 % Command : run_E %s %d THM
% 0.06/0.25 % Computer : n023.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Mon May 20 08:54:22 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.10/0.33 Running higher-order theorem proving
% 0.10/0.33 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.10/0.34 # Version: 3.1.0-ho
% 0.10/0.34 # Preprocessing class: HSSSSMSSSSSNSFN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting new_ho_10 with 1200s (4) cores
% 0.10/0.34 # Starting ehoh_best8_lambda with 600s (2) cores
% 0.10/0.34 # Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.34 # Starting sh4l with 300s (1) cores
% 0.10/0.34 # sh4l with pid 13769 completed with status 0
% 0.10/0.34 # Result found by sh4l
% 0.10/0.34 # Preprocessing class: HSSSSMSSSSSNSFN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting new_ho_10 with 1200s (4) cores
% 0.10/0.34 # Starting ehoh_best8_lambda with 600s (2) cores
% 0.10/0.34 # Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.34 # Starting sh4l with 300s (1) cores
% 0.10/0.34 # No SInE strategy applied
% 0.10/0.34 # Search class: HGHNF-FFSS00-SSFFFFNN
% 0.10/0.34 # partial match(1): HGHNF-FFSS00-SFFFFFNN
% 0.10/0.34 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.34 # Starting new_ho_10 with 163s (1) cores
% 0.10/0.34 # new_ho_10 with pid 13775 completed with status 0
% 0.10/0.34 # Result found by new_ho_10
% 0.10/0.34 # Preprocessing class: HSSSSMSSSSSNSFN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting new_ho_10 with 1200s (4) cores
% 0.10/0.34 # Starting ehoh_best8_lambda with 600s (2) cores
% 0.10/0.34 # Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.34 # Starting sh4l with 300s (1) cores
% 0.10/0.34 # No SInE strategy applied
% 0.10/0.34 # Search class: HGHNF-FFSS00-SSFFFFNN
% 0.10/0.34 # partial match(1): HGHNF-FFSS00-SFFFFFNN
% 0.10/0.34 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.34 # Starting new_ho_10 with 163s (1) cores
% 0.10/0.34 # Preprocessing time : 0.001 s
% 0.10/0.34 # Presaturation interreduction done
% 0.10/0.34
% 0.10/0.34 # Proof found!
% 0.10/0.34 # SZS status Unsatisfiable
% 0.10/0.34 # SZS output start CNFRefutation
% See solution above
% 0.10/0.34 # Parsed axioms : 4
% 0.10/0.34 # Removed by relevancy pruning/SinE : 0
% 0.10/0.34 # Initial clauses : 44
% 0.10/0.34 # Removed in clause preprocessing : 23
% 0.10/0.34 # Initial clauses in saturation : 21
% 0.10/0.34 # Processed clauses : 20
% 0.10/0.34 # ...of these trivial : 0
% 0.10/0.34 # ...subsumed : 3
% 0.10/0.34 # ...remaining for further processing : 17
% 0.10/0.34 # Other redundant clauses eliminated : 0
% 0.10/0.34 # Clauses deleted for lack of memory : 0
% 0.10/0.34 # Backward-subsumed : 3
% 0.10/0.34 # Backward-rewritten : 8
% 0.10/0.34 # Generated clauses : 1
% 0.10/0.34 # ...of the previous two non-redundant : 4
% 0.10/0.34 # ...aggressively subsumed : 0
% 0.10/0.34 # Contextual simplify-reflections : 11
% 0.10/0.34 # Paramodulations : 0
% 0.10/0.34 # Factorizations : 0
% 0.10/0.34 # NegExts : 0
% 0.10/0.34 # Equation resolutions : 0
% 0.10/0.34 # Disequality decompositions : 0
% 0.10/0.34 # Total rewrite steps : 9
% 0.10/0.34 # ...of those cached : 6
% 0.10/0.34 # Propositional unsat checks : 0
% 0.10/0.34 # Propositional check models : 0
% 0.10/0.34 # Propositional check unsatisfiable : 0
% 0.10/0.34 # Propositional clauses : 0
% 0.10/0.34 # Propositional clauses after purity: 0
% 0.10/0.34 # Propositional unsat core size : 0
% 0.10/0.34 # Propositional preprocessing time : 0.000
% 0.10/0.34 # Propositional encoding time : 0.000
% 0.10/0.34 # Propositional solver time : 0.000
% 0.10/0.34 # Success case prop preproc time : 0.000
% 0.10/0.34 # Success case prop encoding time : 0.000
% 0.10/0.34 # Success case prop solver time : 0.000
% 0.10/0.34 # Current number of processed clauses : 5
% 0.10/0.34 # Positive orientable unit clauses : 4
% 0.10/0.34 # Positive unorientable unit clauses: 0
% 0.10/0.34 # Negative unit clauses : 1
% 0.10/0.34 # Non-unit-clauses : 0
% 0.10/0.34 # Current number of unprocessed clauses: 5
% 0.10/0.34 # ...number of literals in the above : 20
% 0.10/0.34 # Current number of archived formulas : 0
% 0.10/0.34 # Current number of archived clauses : 12
% 0.10/0.34 # Clause-clause subsumption calls (NU) : 24
% 0.10/0.34 # Rec. Clause-clause subsumption calls : 19
% 0.10/0.34 # Non-unit clause-clause subsumptions : 16
% 0.10/0.34 # Unit Clause-clause subsumption calls : 2
% 0.10/0.34 # Rewrite failures with RHS unbound : 0
% 0.10/0.34 # BW rewrite match attempts : 2
% 0.10/0.34 # BW rewrite match successes : 2
% 0.10/0.34 # Condensation attempts : 20
% 0.10/0.34 # Condensation successes : 0
% 0.10/0.34 # Termbank termtop insertions : 1771
% 0.10/0.34 # Search garbage collected termcells : 260
% 0.10/0.34
% 0.10/0.34 # -------------------------------------------------
% 0.10/0.34 # User time : 0.003 s
% 0.10/0.34 # System time : 0.001 s
% 0.10/0.34 # Total time : 0.004 s
% 0.10/0.34 # Maximum resident set size: 1792 pages
% 0.10/0.34
% 0.10/0.34 # -------------------------------------------------
% 0.10/0.34 # User time : 0.004 s
% 0.10/0.34 # System time : 0.002 s
% 0.10/0.34 # Total time : 0.006 s
% 0.10/0.34 # Maximum resident set size: 1688 pages
% 0.10/0.34 % E---3.1 exiting
% 0.10/0.34 % E exiting
%------------------------------------------------------------------------------