TSTP Solution File: ITP399_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP399_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Mon May 20 22:21:10 EDT 2024
% Result : Theorem 0.39s 0.59s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 22 ( 7 unt; 12 typ; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_c_prod_b_complement_domain_ell2_a_c_prod_b_complement_domain_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort2,type,
'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort3,type,
'A_c_prod_ell2_a_c_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort4,type,
'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_sort5,type,
'A_a_c_prod_b_complement_domain_prod_ell2_a_a_c_prod_b_complement_domain_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$': $tType ).
tff(decl_56,type,
'complements$': ( 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'A_a_c_prod_b_complement_domain_prod_ell2_a_a_c_prod_b_complement_domain_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > $o ).
tff(decl_194,type,
'f$': 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_258,type,
'g$': 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_310,type,
'compatible$': ( 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > $o ).
tff(decl_620,type,
'register_pair$': ( 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'A_c_prod_b_complement_domain_ell2_a_c_prod_b_complement_domain_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > 'A_a_c_prod_b_complement_domain_prod_ell2_a_a_c_prod_b_complement_domain_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_657,type,
'register_pair$a': ( 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' * 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ) > 'A_c_prod_ell2_a_c_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(decl_721,type,
'complement$': 'A_c_prod_ell2_a_c_prod_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' > 'A_c_prod_b_complement_domain_ell2_a_c_prod_b_complement_domain_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$' ).
tff(conjecture0,conjecture,
'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture0) ).
tff(axiom18,axiom,
! [X26: 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$',X2: 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$'] :
( 'compatible$'(X26,X2)
=> 'complements$'(X2,'register_pair$'(X26,'complement$'('register_pair$a'(X26,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom18) ).
tff(axiom3,axiom,
'compatible$'('f$','g$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom3) ).
tff(c_0_3,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture0])]) ).
tff(c_0_4,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
tff(c_0_5,plain,
! [X1436: 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$',X1437: 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$'] :
( ~ 'compatible$'(X1436,X1437)
| 'complements$'(X1437,'register_pair$'(X1436,'complement$'('register_pair$a'(X1436,X1437)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom18])])]) ).
tcf(c_0_6,negated_conjecture,
~ 'complements$'('g$','register_pair$'('f$','complement$'('register_pair$a'('f$','g$')))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,plain,
! [X4: 'A_ell2_a_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$',X2: 'C_ell2_c_ell2_cblinfun_b_ell2_b_ell2_cblinfun_fun$'] :
( 'complements$'(X2,'register_pair$'(X4,'complement$'('register_pair$a'(X4,X2))))
| ~ 'compatible$'(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,plain,
'compatible$'('f$','g$'),
inference(split_conjunct,[status(thm)],[axiom3]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : ITP399_1 : TPTP v8.2.0. Released v8.0.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n022.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sat May 18 16:21:22 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.39/0.59 # Version: 3.1.0
% 0.39/0.59 # partial match(1): FMLMSMSMSSSNFFN
% 0.39/0.59 # Preprocessing class: FMLMSMLMSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # Starting sh5l with 300s (1) cores
% 0.39/0.59 # new_bool_1 with pid 11649 completed with status 0
% 0.39/0.59 # Result found by new_bool_1
% 0.39/0.59 # partial match(1): FMLMSMSMSSSNFFN
% 0.39/0.59 # Preprocessing class: FMLMSMLMSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.59 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.39/0.59 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 135s (1) cores
% 0.39/0.59 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 11651 completed with status 0
% 0.39/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.39/0.59 # partial match(1): FMLMSMSMSSSNFFN
% 0.39/0.59 # Preprocessing class: FMLMSMLMSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.39/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.39/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.59 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.39/0.59 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 135s (1) cores
% 0.39/0.59 # Preprocessing time : 0.002 s
% 0.39/0.59 # Presaturation interreduction done
% 0.39/0.59
% 0.39/0.59 # Proof found!
% 0.39/0.59 # SZS status Theorem
% 0.39/0.59 # SZS output start CNFRefutation
% See solution above
% 0.39/0.59 # Parsed axioms : 1679
% 0.39/0.59 # Removed by relevancy pruning/SinE : 1648
% 0.39/0.59 # Initial clauses : 46
% 0.39/0.59 # Removed in clause preprocessing : 2
% 0.39/0.59 # Initial clauses in saturation : 44
% 0.39/0.59 # Processed clauses : 80
% 0.39/0.59 # ...of these trivial : 0
% 0.39/0.59 # ...subsumed : 5
% 0.39/0.59 # ...remaining for further processing : 75
% 0.39/0.59 # Other redundant clauses eliminated : 4
% 0.39/0.59 # Clauses deleted for lack of memory : 0
% 0.39/0.59 # Backward-subsumed : 0
% 0.39/0.59 # Backward-rewritten : 1
% 0.39/0.59 # Generated clauses : 12
% 0.39/0.59 # ...of the previous two non-redundant : 9
% 0.39/0.59 # ...aggressively subsumed : 0
% 0.39/0.59 # Contextual simplify-reflections : 0
% 0.39/0.59 # Paramodulations : 8
% 0.39/0.59 # Factorizations : 0
% 0.39/0.59 # NegExts : 0
% 0.39/0.59 # Equation resolutions : 4
% 0.39/0.59 # Disequality decompositions : 0
% 0.39/0.59 # Total rewrite steps : 4
% 0.39/0.59 # ...of those cached : 2
% 0.39/0.59 # Propositional unsat checks : 0
% 0.39/0.59 # Propositional check models : 0
% 0.39/0.59 # Propositional check unsatisfiable : 0
% 0.39/0.59 # Propositional clauses : 0
% 0.39/0.59 # Propositional clauses after purity: 0
% 0.39/0.59 # Propositional unsat core size : 0
% 0.39/0.59 # Propositional preprocessing time : 0.000
% 0.39/0.59 # Propositional encoding time : 0.000
% 0.39/0.59 # Propositional solver time : 0.000
% 0.39/0.59 # Success case prop preproc time : 0.000
% 0.39/0.59 # Success case prop encoding time : 0.000
% 0.39/0.59 # Success case prop solver time : 0.000
% 0.39/0.59 # Current number of processed clauses : 31
% 0.39/0.59 # Positive orientable unit clauses : 11
% 0.39/0.59 # Positive unorientable unit clauses: 0
% 0.39/0.59 # Negative unit clauses : 1
% 0.39/0.59 # Non-unit-clauses : 19
% 0.39/0.59 # Current number of unprocessed clauses: 12
% 0.39/0.59 # ...number of literals in the above : 31
% 0.39/0.59 # Current number of archived formulas : 0
% 0.39/0.59 # Current number of archived clauses : 40
% 0.39/0.59 # Clause-clause subsumption calls (NU) : 185
% 0.39/0.59 # Rec. Clause-clause subsumption calls : 158
% 0.39/0.59 # Non-unit clause-clause subsumptions : 5
% 0.39/0.59 # Unit Clause-clause subsumption calls : 0
% 0.39/0.59 # Rewrite failures with RHS unbound : 0
% 0.39/0.59 # BW rewrite match attempts : 1
% 0.39/0.59 # BW rewrite match successes : 1
% 0.39/0.59 # Condensation attempts : 0
% 0.39/0.59 # Condensation successes : 0
% 0.39/0.59 # Termbank termtop insertions : 11995
% 0.39/0.59 # Search garbage collected termcells : 7500
% 0.39/0.59
% 0.39/0.59 # -------------------------------------------------
% 0.39/0.59 # User time : 0.008 s
% 0.39/0.59 # System time : 0.008 s
% 0.39/0.59 # Total time : 0.016 s
% 0.39/0.59 # Maximum resident set size: 5328 pages
% 0.39/0.59
% 0.39/0.59 # -------------------------------------------------
% 0.39/0.59 # User time : 0.067 s
% 0.39/0.59 # System time : 0.010 s
% 0.39/0.59 # Total time : 0.078 s
% 0.39/0.59 # Maximum resident set size: 4016 pages
% 0.39/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------