TSTP Solution File: SYO500_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO500_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:52:32 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 457 ( 0 equ)
% Maximal formula atoms : 131 ( 12 avg)
% Number of connectives : 643 ( 222 ~; 334 |; 83 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 6 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: $o > $o ).
tff(decl_23,type,
x: $o ).
tff(decl_24,type,
epred1_0: $o ).
tff(decl_25,type,
epred2_0: $o ).
fof(con,conjecture,
( f(f(f(x)))
<=> f(x) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ( ( ( ~ x
| ~ f($true) )
& ( x
| ~ f($false) ) )
| ~ f($true) )
& ( ( ( ~ x
| f($true) )
& ( x
| f($false) ) )
| ~ f($false) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred2_0
<=> ( ( ( ( ~ x
| ~ f($true) )
& ( x
| ~ f($false) ) )
| f($true) )
& ( ( ( ~ x
| f($true) )
& ( x
| f($false) ) )
| f($false) ) ) ),
introduced(definition) ).
fof(c_0_3,negated_conjecture,
~ ( ( ( epred1_0
| f($true) )
& ( epred2_0
| f($false) ) )
<=> ( ( ~ x
| f($true) )
& ( x
| f($false) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]),c_0_1]),c_0_2]) ).
fof(c_0_4,plain,
( ( ~ x
| ~ f($true)
| f($true)
| ~ epred2_0 )
& ( x
| ~ f($false)
| f($true)
| ~ epred2_0 )
& ( ~ x
| f($true)
| f($false)
| ~ epred2_0 )
& ( x
| f($false)
| f($false)
| ~ epred2_0 )
& ( ~ x
| x
| ~ x
| x
| epred2_0 )
& ( ~ f($false)
| x
| ~ x
| x
| epred2_0 )
& ( ~ x
| ~ f($true)
| ~ x
| x
| epred2_0 )
& ( ~ f($false)
| ~ f($true)
| ~ x
| x
| epred2_0 )
& ( ~ f($false)
| ~ x
| x
| epred2_0 )
& ( ~ x
| x
| f($false)
| x
| epred2_0 )
& ( ~ f($false)
| x
| f($false)
| x
| epred2_0 )
& ( ~ x
| ~ f($true)
| f($false)
| x
| epred2_0 )
& ( ~ f($false)
| ~ f($true)
| f($false)
| x
| epred2_0 )
& ( ~ f($false)
| f($false)
| x
| epred2_0 )
& ( ~ x
| x
| ~ x
| f($true)
| epred2_0 )
& ( ~ f($false)
| x
| ~ x
| f($true)
| epred2_0 )
& ( ~ x
| ~ f($true)
| ~ x
| f($true)
| epred2_0 )
& ( ~ f($false)
| ~ f($true)
| ~ x
| f($true)
| epred2_0 )
& ( ~ f($false)
| ~ x
| f($true)
| epred2_0 )
& ( ~ x
| x
| f($false)
| f($true)
| epred2_0 )
& ( ~ f($false)
| x
| f($false)
| f($true)
| epred2_0 )
& ( ~ x
| ~ f($true)
| f($false)
| f($true)
| epred2_0 )
& ( ~ f($false)
| ~ f($true)
| f($false)
| f($true)
| epred2_0 )
& ( ~ f($false)
| f($false)
| f($true)
| epred2_0 )
& ( ~ x
| x
| ~ f($true)
| epred2_0 )
& ( ~ f($false)
| x
| ~ f($true)
| epred2_0 )
& ( ~ x
| ~ f($true)
| ~ f($true)
| epred2_0 )
& ( ~ f($false)
| ~ f($true)
| ~ f($true)
| epred2_0 )
& ( ~ f($false)
| ~ f($true)
| epred2_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,negated_conjecture,
( ( ~ x
| x
| ~ epred2_0
| ~ epred1_0 )
& ( ~ f($false)
| x
| ~ epred2_0
| ~ epred1_0 )
& ( ~ x
| ~ f($true)
| ~ epred2_0
| ~ epred1_0 )
& ( ~ f($false)
| ~ f($true)
| ~ epred2_0
| ~ epred1_0 )
& ( ~ x
| x
| ~ f($false)
| ~ epred1_0 )
& ( ~ f($false)
| x
| ~ f($false)
| ~ epred1_0 )
& ( ~ x
| ~ f($true)
| ~ f($false)
| ~ epred1_0 )
& ( ~ f($false)
| ~ f($true)
| ~ f($false)
| ~ epred1_0 )
& ( ~ x
| x
| ~ epred2_0
| ~ f($true) )
& ( ~ f($false)
| x
| ~ epred2_0
| ~ f($true) )
& ( ~ x
| ~ f($true)
| ~ epred2_0
| ~ f($true) )
& ( ~ f($false)
| ~ f($true)
| ~ epred2_0
| ~ f($true) )
& ( ~ x
| x
| ~ f($false)
| ~ f($true) )
& ( ~ f($false)
| x
| ~ f($false)
| ~ f($true) )
& ( ~ x
| ~ f($true)
| ~ f($false)
| ~ f($true) )
& ( ~ f($false)
| ~ f($true)
| ~ f($false)
| ~ f($true) )
& ( ~ x
| f($true)
| epred1_0
| f($true) )
& ( x
| f($false)
| epred1_0
| f($true) )
& ( ~ x
| f($true)
| epred2_0
| f($false) )
& ( x
| f($false)
| epred2_0
| f($false) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( epred2_0
| ~ x
| ~ f($true)
| ~ f($true) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ x
| ~ f($true)
| ~ epred2_0
| ~ f($true) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( x
| f($false)
| f($false)
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( x
| f($false)
| epred2_0
| f($false) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( f($true)
| epred1_0
| f($true)
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( epred2_0
| ~ x
| ~ f($true) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ x
| ~ epred2_0
| ~ f($true) ),
inference(cn,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
( ( ~ x
| ~ f($true)
| ~ f($true)
| ~ epred1_0 )
& ( x
| ~ f($false)
| ~ f($true)
| ~ epred1_0 )
& ( ~ x
| f($true)
| ~ f($false)
| ~ epred1_0 )
& ( x
| f($false)
| ~ f($false)
| ~ epred1_0 )
& ( ~ x
| x
| ~ x
| x
| epred1_0 )
& ( ~ f($false)
| x
| ~ x
| x
| epred1_0 )
& ( ~ x
| ~ f($true)
| ~ x
| x
| epred1_0 )
& ( ~ f($false)
| ~ f($true)
| ~ x
| x
| epred1_0 )
& ( f($false)
| ~ x
| x
| epred1_0 )
& ( ~ x
| x
| f($false)
| x
| epred1_0 )
& ( ~ f($false)
| x
| f($false)
| x
| epred1_0 )
& ( ~ x
| ~ f($true)
| f($false)
| x
| epred1_0 )
& ( ~ f($false)
| ~ f($true)
| f($false)
| x
| epred1_0 )
& ( f($false)
| f($false)
| x
| epred1_0 )
& ( ~ x
| x
| ~ x
| f($true)
| epred1_0 )
& ( ~ f($false)
| x
| ~ x
| f($true)
| epred1_0 )
& ( ~ x
| ~ f($true)
| ~ x
| f($true)
| epred1_0 )
& ( ~ f($false)
| ~ f($true)
| ~ x
| f($true)
| epred1_0 )
& ( f($false)
| ~ x
| f($true)
| epred1_0 )
& ( ~ x
| x
| f($false)
| f($true)
| epred1_0 )
& ( ~ f($false)
| x
| f($false)
| f($true)
| epred1_0 )
& ( ~ x
| ~ f($true)
| f($false)
| f($true)
| epred1_0 )
& ( ~ f($false)
| ~ f($true)
| f($false)
| f($true)
| epred1_0 )
& ( f($false)
| f($false)
| f($true)
| epred1_0 )
& ( ~ x
| x
| f($true)
| epred1_0 )
& ( ~ f($false)
| x
| f($true)
| epred1_0 )
& ( ~ x
| ~ f($true)
| f($true)
| epred1_0 )
& ( ~ f($false)
| ~ 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])])]) ).
cnf(c_0_14,plain,
( x
| f($false)
| ~ epred2_0 ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( x
| epred2_0
| f($false) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( epred1_0
| f($true)
| ~ x ),
inference(cn,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ x
| ~ f($true) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ f($false)
| ~ f($true)
| ~ f($false)
| ~ f($true) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( x
| ~ f($false)
| ~ f($false)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( x
| f($true)
| epred1_0
| ~ f($false) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( x
| f($false) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( epred1_0
| ~ x ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ f($true)
| ~ f($false) ),
inference(cn,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( f($true)
| f($false)
| ~ x
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,plain,
( f($true)
| ~ x
| ~ f($false)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( x
| ~ epred1_0
| ~ f($false) ),
inference(cn,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( epred1_0
| f($true) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ f($true),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
( f($true)
| epred2_0
| f($false)
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,plain,
( f($false)
| f($true)
| ~ epred2_0 ),
inference(csr,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_31,plain,
( ~ epred1_0
| ~ f($false) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_25,c_0_26]),c_0_23]) ).
cnf(c_0_32,plain,
epred1_0,
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( f($false)
| f($true) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29,c_0_21]),c_0_30]) ).
cnf(c_0_34,plain,
~ f($false),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_33,c_0_34]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO500_8 : TPTP v8.2.0. Released v8.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 11:03:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 10125 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 10128 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 3
% 0.21/0.50 # Removed by relevancy pruning/SinE : 2
% 0.21/0.50 # Initial clauses : 78
% 0.21/0.50 # Removed in clause preprocessing : 46
% 0.21/0.50 # Initial clauses in saturation : 32
% 0.21/0.50 # Processed clauses : 47
% 0.21/0.50 # ...of these trivial : 1
% 0.21/0.50 # ...subsumed : 16
% 0.21/0.50 # ...remaining for further processing : 29
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 12
% 0.21/0.50 # Backward-rewritten : 3
% 0.21/0.50 # Generated clauses : 7
% 0.21/0.50 # ...of the previous two non-redundant : 6
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 13
% 0.21/0.50 # Paramodulations : 6
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 4
% 0.21/0.50 # ...of those cached : 2
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 4
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 25
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 41
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 37
% 0.21/0.50 # Non-unit clause-clause subsumptions : 37
% 0.21/0.50 # Unit Clause-clause subsumption calls : 6
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 2
% 0.21/0.50 # BW rewrite match successes : 2
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 2496
% 0.21/0.50 # Search garbage collected termcells : 476
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1792 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1680 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------