TSTP Solution File: SYO499_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO499_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:51:48 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 424 ( 174 equ)
% Maximal formula atoms : 306 ( 16 avg)
% Number of connectives : 657 ( 258 ~; 295 |; 104 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 89 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-1 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
a: $o ).
tff(decl_23,type,
b: $o ).
tff(decl_24,type,
c: $o ).
tff(decl_25,type,
f: $o > $i ).
tff(decl_26,type,
f1: $o > $i ).
tff(decl_27,type,
f2: $o > $i ).
tff(decl_28,type,
g: $o > $i ).
tff(decl_29,type,
g1: $o > $i ).
tff(decl_30,type,
g2: $o > $i ).
fof(con,conjecture,
( f(a) = g(b)
| f(b) != g(a)
| f1(a) = g1(c)
| f1(c) != g1(a)
| f2(b) = g2(c)
| f2(c) != g2(b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( ~ a
| ( ( ~ b
| f($true) = g($true) )
& ( b
| f($true) = g($false) ) ) )
& ( a
| ( ( ~ b
| f($false) = g($true) )
& ( b
| f($false) = g($false) ) ) ) )
| ~ ( ( ~ b
| ( ( ~ a
| f($true) = g($true) )
& ( a
| f($true) = g($false) ) ) )
& ( b
| ( ( ~ a
| f($false) = g($true) )
& ( a
| f($false) = g($false) ) ) ) )
| ( ( ~ a
| ( ( ~ c
| f1($true) = g1($true) )
& ( c
| f1($true) = g1($false) ) ) )
& ( a
| ( ( ~ c
| f1($false) = g1($true) )
& ( c
| f1($false) = g1($false) ) ) ) )
| ~ ( ( ~ c
| ( ( ~ a
| f1($true) = g1($true) )
& ( a
| f1($true) = g1($false) ) ) )
& ( c
| ( ( ~ a
| f1($false) = g1($true) )
& ( a
| f1($false) = g1($false) ) ) ) )
| ( ( ~ b
| ( ( ~ c
| f2($true) = g2($true) )
& ( c
| f2($true) = g2($false) ) ) )
& ( b
| ( ( ~ c
| f2($false) = g2($true) )
& ( c
| f2($false) = g2($false) ) ) ) )
| ~ ( ( ~ c
| ( ( ~ b
| f2($true) = g2($true) )
& ( b
| f2($true) = g2($false) ) ) )
& ( c
| ( ( ~ b
| f2($false) = g2($true) )
& ( b
| f2($false) = g2($false) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_2,negated_conjecture,
( ( ~ a
| a )
& ( ~ b
| b
| a )
& ( f($false) != g($false)
| b
| a )
& ( ~ b
| f($false) != g($true)
| a )
& ( f($false) != g($false)
| f($false) != g($true)
| a )
& ( ~ a
| ~ b
| b )
& ( ~ b
| b
| ~ b
| b )
& ( f($false) != g($false)
| b
| ~ b
| b )
& ( ~ b
| f($false) != g($true)
| ~ b
| b )
& ( f($false) != g($false)
| f($false) != g($true)
| ~ b
| b )
& ( ~ a
| f($true) != g($false)
| b )
& ( ~ b
| b
| f($true) != g($false)
| b )
& ( f($false) != g($false)
| b
| f($true) != g($false)
| b )
& ( ~ b
| f($false) != g($true)
| f($true) != g($false)
| b )
& ( f($false) != g($false)
| f($false) != g($true)
| f($true) != g($false)
| b )
& ( ~ a
| ~ b
| f($true) != g($true) )
& ( ~ b
| b
| ~ b
| f($true) != g($true) )
& ( f($false) != g($false)
| b
| ~ b
| f($true) != g($true) )
& ( ~ b
| f($false) != g($true)
| ~ b
| f($true) != g($true) )
& ( f($false) != g($false)
| f($false) != g($true)
| ~ b
| f($true) != g($true) )
& ( ~ a
| f($true) != g($false)
| f($true) != g($true) )
& ( ~ b
| b
| f($true) != g($false)
| f($true) != g($true) )
& ( f($false) != g($false)
| b
| f($true) != g($false)
| f($true) != g($true) )
& ( ~ b
| f($false) != g($true)
| f($true) != g($false)
| f($true) != g($true) )
& ( f($false) != g($false)
| f($false) != g($true)
| f($true) != g($false)
| f($true) != g($true) )
& ( ~ a
| f($true) = g($true)
| ~ b )
& ( a
| f($true) = g($false)
| ~ b )
& ( ~ a
| f($false) = g($true)
| b )
& ( a
| f($false) = g($false)
| b )
& ( ~ a
| a )
& ( ~ c
| c
| a )
& ( f1($false) != g1($false)
| c
| a )
& ( ~ c
| f1($false) != g1($true)
| a )
& ( f1($false) != g1($false)
| f1($false) != g1($true)
| a )
& ( ~ a
| ~ c
| c )
& ( ~ c
| c
| ~ c
| c )
& ( f1($false) != g1($false)
| c
| ~ c
| c )
& ( ~ c
| f1($false) != g1($true)
| ~ c
| c )
& ( f1($false) != g1($false)
| f1($false) != g1($true)
| ~ c
| c )
& ( ~ a
| f1($true) != g1($false)
| c )
& ( ~ c
| c
| f1($true) != g1($false)
| c )
& ( f1($false) != g1($false)
| c
| f1($true) != g1($false)
| c )
& ( ~ c
| f1($false) != g1($true)
| f1($true) != g1($false)
| c )
& ( f1($false) != g1($false)
| f1($false) != g1($true)
| f1($true) != g1($false)
| c )
& ( ~ a
| ~ c
| f1($true) != g1($true) )
& ( ~ c
| c
| ~ c
| f1($true) != g1($true) )
& ( f1($false) != g1($false)
| c
| ~ c
| f1($true) != g1($true) )
& ( ~ c
| f1($false) != g1($true)
| ~ c
| f1($true) != g1($true) )
& ( f1($false) != g1($false)
| f1($false) != g1($true)
| ~ c
| f1($true) != g1($true) )
& ( ~ a
| f1($true) != g1($false)
| f1($true) != g1($true) )
& ( ~ c
| c
| f1($true) != g1($false)
| f1($true) != g1($true) )
& ( f1($false) != g1($false)
| c
| f1($true) != g1($false)
| f1($true) != g1($true) )
& ( ~ c
| f1($false) != g1($true)
| f1($true) != g1($false)
| f1($true) != g1($true) )
& ( f1($false) != g1($false)
| f1($false) != g1($true)
| f1($true) != g1($false)
| f1($true) != g1($true) )
& ( ~ a
| f1($true) = g1($true)
| ~ c )
& ( a
| f1($true) = g1($false)
| ~ c )
& ( ~ a
| f1($false) = g1($true)
| c )
& ( a
| f1($false) = g1($false)
| c )
& ( ~ b
| b )
& ( ~ c
| c
| b )
& ( f2($false) != g2($false)
| c
| b )
& ( ~ c
| f2($false) != g2($true)
| b )
& ( f2($false) != g2($false)
| f2($false) != g2($true)
| b )
& ( ~ b
| ~ c
| c )
& ( ~ c
| c
| ~ c
| c )
& ( f2($false) != g2($false)
| c
| ~ c
| c )
& ( ~ c
| f2($false) != g2($true)
| ~ c
| c )
& ( f2($false) != g2($false)
| f2($false) != g2($true)
| ~ c
| c )
& ( ~ b
| f2($true) != g2($false)
| c )
& ( ~ c
| c
| f2($true) != g2($false)
| c )
& ( f2($false) != g2($false)
| c
| f2($true) != g2($false)
| c )
& ( ~ c
| f2($false) != g2($true)
| f2($true) != g2($false)
| c )
& ( f2($false) != g2($false)
| f2($false) != g2($true)
| f2($true) != g2($false)
| c )
& ( ~ b
| ~ c
| f2($true) != g2($true) )
& ( ~ c
| c
| ~ c
| f2($true) != g2($true) )
& ( f2($false) != g2($false)
| c
| ~ c
| f2($true) != g2($true) )
& ( ~ c
| f2($false) != g2($true)
| ~ c
| f2($true) != g2($true) )
& ( f2($false) != g2($false)
| f2($false) != g2($true)
| ~ c
| f2($true) != g2($true) )
& ( ~ b
| f2($true) != g2($false)
| f2($true) != g2($true) )
& ( ~ c
| c
| f2($true) != g2($false)
| f2($true) != g2($true) )
& ( f2($false) != g2($false)
| c
| f2($true) != g2($false)
| f2($true) != g2($true) )
& ( ~ c
| f2($false) != g2($true)
| f2($true) != g2($false)
| f2($true) != g2($true) )
& ( f2($false) != g2($false)
| f2($false) != g2($true)
| f2($true) != g2($false)
| f2($true) != g2($true) )
& ( ~ b
| f2($true) = g2($true)
| ~ c )
& ( b
| f2($true) = g2($false)
| ~ c )
& ( ~ b
| f2($false) = g2($true)
| c )
& ( b
| f2($false) = g2($false)
| c ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3,negated_conjecture,
( f2($true) = g2($true)
| ~ b
| ~ c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ b
| ~ c
| f2($true) != g2($true) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( c
| a
| f1($false) != g1($false) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( a
| f1($false) = g1($false)
| c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( b
| a
| f($false) != g($false) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( a
| f($false) = g($false)
| b ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( f($true) = g($true)
| ~ a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ~ a
| ~ b
| f($true) != g($true) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ~ c
| ~ b ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( c
| a ),
inference(csr,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( b
| a ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( f1($true) = g1($true)
| ~ a
| ~ c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( ~ a
| ~ c
| f1($true) != g1($true) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( c
| b
| f2($false) != g2($false) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
( b
| f2($false) = g2($false)
| c ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
( ~ b
| ~ a ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
a,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ c
| ~ a ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( c
| b ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
~ c,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO499_8 : TPTP v8.2.0. Released v8.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 10:15:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 622 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSF-FFMS11-SFFFFFNN
% 0.19/0.48 # partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 164s (1) cores
% 0.19/0.48 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 626 completed with status 0
% 0.19/0.48 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.19/0.48 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSF-FFMS11-SFFFFFNN
% 0.19/0.48 # partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 164s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 10
% 0.19/0.48 # Removed by relevancy pruning/SinE : 9
% 0.19/0.48 # Initial clauses : 87
% 0.19/0.48 # Removed in clause preprocessing : 36
% 0.19/0.48 # Initial clauses in saturation : 51
% 0.19/0.48 # Processed clauses : 55
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 12
% 0.19/0.48 # ...remaining for further processing : 42
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 13
% 0.19/0.48 # Backward-rewritten : 14
% 0.19/0.48 # Generated clauses : 37
% 0.19/0.48 # ...of the previous two non-redundant : 22
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 12
% 0.19/0.48 # Paramodulations : 32
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 14
% 0.19/0.48 # ...of those cached : 13
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 10
% 0.19/0.48 # Positive orientable unit clauses : 1
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 7
% 0.19/0.48 # Current number of unprocessed clauses: 18
% 0.19/0.48 # ...number of literals in the above : 44
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 32
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 94
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 54
% 0.19/0.48 # Non-unit clause-clause subsumptions : 30
% 0.19/0.48 # Unit Clause-clause subsumption calls : 7
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 1
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 3157
% 0.19/0.48 # Search garbage collected termcells : 357
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.007 s
% 0.19/0.48 # Maximum resident set size: 1908 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.005 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1748 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------