TSTP Solution File: SYO506^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO506^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:47:31 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 55 ( 30 equ; 0 cnn)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 110 ( 25 ~; 17 |; 8 &; 60 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-3 aty)
% Number of variables : 22 ( 0 ^ 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
c: $o > $i > $i > $i ).
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(claim,conjecture,
( ! [X1: $i,X2: $i] :
( ( c @ ( X1 = X2 ) @ X1 @ X2 )
= X2 )
| ~ ! [X1: $i,X2: $i] :
( ( c @ $true @ X1 @ X2 )
= X1 )
| ~ ! [X1: $i,X2: $i] :
( ( c @ ~ $true @ X1 @ X2 )
= X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',claim) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i,X2: $i] :
( ( ( X1 != X2 )
| ( ( c @ $true @ X1 @ X2 )
= X2 ) )
& ( ( X1 = X2 )
| ( ( c @ $false @ X1 @ X2 )
= X2 ) ) )
| ~ ! [X1: $i,X2: $i] :
( ( c @ $true @ X1 @ X2 )
= X1 )
| ~ ! [X1: $i,X2: $i] :
( ( ~ ~ $true
| ( ( c @ $true @ X1 @ X2 )
= X2 ) )
& ( ~ $true
| ( ( c @ $false @ X1 @ X2 )
= X2 ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[claim])]) ).
thf(c_0_2,negated_conjecture,
! [X11: $i,X12: $i,X13: $i,X14: $i] :
( ( ( esk1_0 != esk2_0 )
| ( esk1_0 = esk2_0 ) )
& ( ( ( c @ $false @ esk1_0 @ esk2_0 )
!= esk2_0 )
| ( esk1_0 = esk2_0 ) )
& ( ( esk1_0 != esk2_0 )
| ( ( c @ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) )
& ( ( ( c @ $false @ esk1_0 @ esk2_0 )
!= esk2_0 )
| ( ( c @ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) )
& ( ( c @ $true @ X11 @ X12 )
= X11 )
& ( $true
| ( ( c @ $true @ X13 @ X14 )
= X14 ) )
& ( ~ $true
| ( ( c @ $false @ X13 @ X14 )
= X14 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( c @ ~ $true @ X1 @ X2 )
= X2 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( esk1_0 != esk2_0 )
| ( ( c @ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i,X1: $i] :
( ( c @ $true @ X1 @ X2 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( esk1_0 = esk2_0 )
| ( ( c @ ~ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i] :
( ( c @ ~ $true @ X1 @ X2 )
= X2 ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
esk1_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO506^1 : TPTP v8.2.0. Released v4.1.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.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:05:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.50 # sh4l with pid 17605 completed with status 0
% 0.20/0.50 # Result found by sh4l
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHPS-FFSF33-SFFFFFNN
% 0.20/0.50 # partial match(3): FHUNS-FFSF33-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 135s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 17611 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.50 # Starting sh4l with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHPS-FFSF33-SFFFFFNN
% 0.20/0.50 # partial match(3): FHUNS-FFSF33-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 135s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 2
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 8
% 0.20/0.50 # Removed in clause preprocessing : 3
% 0.20/0.50 # Initial clauses in saturation : 5
% 0.20/0.50 # Processed clauses : 7
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 1
% 0.20/0.50 # ...remaining for further processing : 6
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 2
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 3
% 0.20/0.50 # ...of those cached : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 3
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 3
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 401
% 0.20/0.50 # Search garbage collected termcells : 111
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.004 s
% 0.20/0.50 # Maximum resident set size: 1588 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.004 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1692 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------