TSTP Solution File: SYO042^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO042^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 138 ( 1 equ; 0 cnn)
% Maximal formula atoms : 56 ( 6 avg)
% Number of connectives : 161 ( 48 ~; 44 |; 25 &; 37 @)
% ( 5 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 5 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
g: $o > $o ).
thf(decl_23,type,
p: ( $o > $o ) > $o ).
thf(decl_24,type,
x: $o ).
thf(decl_25,type,
y: $o ).
thf(decl_26,type,
esk1_0: $o ).
thf(4,axiom,
( ( x
<~> y )
& ( ( g @ x )
<=> y )
& ( ( g @ y )
<=> x )
& ( p @ g )
& ~ ( p @ $not ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',4) ).
thf(c_0_1,plain,
( ~ ( x
<=> y )
& ( ( ( ~ x
| ( g @ $true ) )
& ( x
| ( g @ $false ) ) )
<=> y )
& ( ( ( ~ y
| ( g @ $true ) )
& ( y
| ( g @ $false ) ) )
<=> x )
& ( p @ g )
& ~ ( p @ $not ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[4])]) ).
thf(c_0_2,plain,
( ( ~ x
| ~ y )
& ( x
| y )
& ( ~ x
| x
| y )
& ( ~ ( g @ $false )
| x
| y )
& ( ~ x
| ~ ( g @ $true )
| y )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| y )
& ( ~ x
| ( g @ $true )
| ~ y )
& ( x
| ( g @ $false )
| ~ y )
& ( ~ y
| y
| x )
& ( ~ ( g @ $false )
| y
| x )
& ( ~ y
| ~ ( g @ $true )
| x )
& ( ~ ( g @ $false )
| ~ ( g @ $true )
| x )
& ( ~ y
| ( g @ $true )
| ~ x )
& ( y
| ( g @ $false )
| ~ x )
& ( p @ g )
& ~ ( p @ $not ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,plain,
( x
| ~ y
| ~ ( g @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
( x
| y ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
~ ( p @ $not ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,plain,
p @ g,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,plain,
( y
| ~ x
| ~ ( g @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,plain,
( x
| ~ ( g @ $true ) ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_9,plain,
$not != g,
inference(ext_sup,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,plain,
( ~ x
| ~ y ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,plain,
( y
| ~ ( g @ $true ) ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,plain,
( ~ esk1_0
<~> ( g @ esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
~ ( g @ $true ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).
thf(c_0_14,plain,
( x
| ( g @ ~ $true )
| ~ y ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,plain,
~ esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]),c_0_13]) ).
thf(c_0_16,plain,
( ( g @ ~ $true )
| x ),
inference(csr,[status(thm)],[c_0_14,c_0_4]) ).
thf(c_0_17,plain,
~ ( g @ ~ $true ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]),c_0_15]) ).
thf(c_0_18,plain,
( y
| ( g @ ~ $true )
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,plain,
x,
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,plain,
( ( g @ ~ $true )
| y ),
inference(csr,[status(thm)],[c_0_18,c_0_4]) ).
thf(c_0_21,plain,
~ y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_19])]) ).
thf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_17]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO042^1 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.22/0.35 % CPULimit : 300
% 0.22/0.35 % WCLimit : 300
% 0.22/0.35 % DateTime : Mon May 20 09:49:38 EDT 2024
% 0.22/0.35 % CPUTime :
% 0.22/0.52 Running higher-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/0.53 # Version: 3.1.0-ho
% 0.22/0.53 # partial match(1): HSSSSLSSSSSCSSN
% 0.22/0.53 # Preprocessing class: HSSSSLSSSSSCSFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting sh3 with 1500s (5) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # sh3 with pid 13011 completed with status 0
% 0.22/0.53 # Result found by sh3
% 0.22/0.53 # partial match(1): HSSSSLSSSSSCSSN
% 0.22/0.53 # Preprocessing class: HSSSSLSSSSSCSFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting sh3 with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGHNF-FFSF00-SSFFFFNN
% 0.22/0.53 # partial match(1): HGHNF-FFSF00-SSSFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting sh3 with 901s (1) cores
% 0.22/0.53 # Starting sh5l with 151s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 151s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 151s (1) cores
% 0.22/0.53 # Starting new_bool_2 with 146s (1) cores
% 0.22/0.53 # sh3 with pid 13022 completed with status 0
% 0.22/0.53 # Result found by sh3
% 0.22/0.53 # partial match(1): HSSSSLSSSSSCSSN
% 0.22/0.53 # Preprocessing class: HSSSSLSSSSSCSFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting sh3 with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: HGHNF-FFSF00-SSFFFFNN
% 0.22/0.53 # partial match(1): HGHNF-FFSF00-SSSFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting sh3 with 901s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 5
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 20
% 0.22/0.53 # Removed in clause preprocessing : 6
% 0.22/0.53 # Initial clauses in saturation : 14
% 0.22/0.53 # Processed clauses : 28
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 6
% 0.22/0.53 # ...remaining for further processing : 21
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 2
% 0.22/0.53 # Backward-rewritten : 2
% 0.22/0.53 # Generated clauses : 10
% 0.22/0.53 # ...of the previous two non-redundant : 7
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 5
% 0.22/0.53 # Paramodulations : 2
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 1
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 2
% 0.22/0.53 # ...of those cached : 1
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 8
% 0.22/0.53 # Positive orientable unit clauses : 2
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 6
% 0.22/0.53 # Non-unit-clauses : 0
% 0.22/0.53 # Current number of unprocessed clauses: 1
% 0.22/0.53 # ...number of literals in the above : 3
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 13
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 11
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 11
% 0.22/0.53 # Non-unit clause-clause subsumptions : 11
% 0.22/0.53 # Unit Clause-clause subsumption calls : 5
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 1
% 0.22/0.53 # BW rewrite match successes : 1
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 1033
% 0.22/0.53 # Search garbage collected termcells : 99
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.004 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.006 s
% 0.22/0.53 # Maximum resident set size: 1752 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.013 s
% 0.22/0.53 # System time : 0.007 s
% 0.22/0.53 # Total time : 0.020 s
% 0.22/0.53 # Maximum resident set size: 1692 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------