TSTP Solution File: ITP364_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP001_1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:18:19 EDT 2024
% Result : Theorem 0.50s 0.61s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 25
% Syntax : Number of formulae : 34 ( 9 unt; 21 typ; 0 def)
% Number of atoms : 17 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 16 ( 9 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_ltln_bool_fun$': $tType ).
tff(decl_sort2,type,
'Nat_a_set_fun$': $tType ).
tff(decl_sort3,type,
'A_ltln$': $tType ).
tff(decl_sort4,type,
'A_ltln_set$': $tType ).
tff(decl_sort5,type,
'Nat_bool_fun$': $tType ).
tff(decl_sort6,type,
'Nat$': $tType ).
tff(decl_23,type,
'w$': 'Nat_a_set_fun$' ).
tff(decl_24,type,
'fun_app$a': ( 'A_ltln_bool_fun$' * 'A_ltln$' ) > $o ).
tff(decl_28,type,
'uu$': 'Nat_bool_fun$' ).
tff(decl_32,type,
'psi_1$': 'A_ltln$' ).
tff(decl_42,type,
'false_ltln$': 'A_ltln$' ).
tff(decl_58,type,
'suffix$': ( 'Nat$' * 'Nat_a_set_fun$' ) > 'Nat_a_set_fun$' ).
tff(decl_71,type,
'g$': ( 'A_ltln$' * 'Nat_a_set_fun$' ) > 'A_ltln_set$' ).
tff(decl_76,type,
'member$': ( 'A_ltln$' * 'A_ltln_set$' ) > $o ).
tff(decl_79,type,
'eps$': 'Nat_bool_fun$' > 'Nat$' ).
tff(decl_87,type,
'release_ltln$': ( 'A_ltln$' * 'A_ltln$' ) > 'A_ltln$' ).
tff(decl_97,type,
'psi_2$': 'A_ltln$' ).
tff(decl_100,type,
'f_G$': ( 'A_ltln$' * 'Nat_a_set_fun$' ) > 'A_ltln_set$' ).
tff(decl_108,type,
'semantics_ltln$': 'Nat_a_set_fun$' > 'A_ltln_bool_fun$' ).
tff(decl_123,type,
'weakUntil_ltln$': ( 'A_ltln$' * 'A_ltln$' ) > 'A_ltln$' ).
tff(decl_125,type,
'phi$': 'A_ltln$' ).
tff(conjecture30,conjecture,
'fun_app$a'('semantics_ltln$'('suffix$'('eps$'('uu$'),'w$')),'release_ltln$'('false_ltln$','weakUntil_ltln$'('psi_1$','psi_2$'))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture30) ).
tff(axiom39,axiom,
! [X60: 'A_ltln$',X3: 'A_ltln$',X61: 'Nat_a_set_fun$'] :
( 'member$'(X60,'g$'(X3,X61))
=> 'fun_app$a'('semantics_ltln$'(X61),'release_ltln$'('false_ltln$',X60)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom39) ).
tff(axiom34,axiom,
'f_G$'('phi$','w$') = 'g$'('phi$','suffix$'('eps$'('uu$'),'w$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom34) ).
tff(axiom32,axiom,
'member$'('weakUntil_ltln$'('psi_1$','psi_2$'),'f_G$'('phi$','w$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom32) ).
tff(c_0_4,negated_conjecture,
~ 'fun_app$a'('semantics_ltln$'('suffix$'('eps$'('uu$'),'w$')),'release_ltln$'('false_ltln$','weakUntil_ltln$'('psi_1$','psi_2$'))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture30])]) ).
tff(c_0_5,plain,
! [X2283: 'A_ltln$',X2284: 'A_ltln$',X2285: 'Nat_a_set_fun$'] :
( ~ 'member$'(X2283,'g$'(X2284,X2285))
| 'fun_app$a'('semantics_ltln$'(X2285),'release_ltln$'('false_ltln$',X2283)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom39])])]) ).
tff(c_0_6,negated_conjecture,
~ 'fun_app$a'('semantics_ltln$'('suffix$'('eps$'('uu$'),'w$')),'release_ltln$'('false_ltln$','weakUntil_ltln$'('psi_1$','psi_2$'))),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tcf(c_0_7,plain,
! [X2: 'A_ltln$',X3: 'A_ltln$',X6: 'Nat_a_set_fun$'] :
( 'fun_app$a'('semantics_ltln$'(X6),'release_ltln$'('false_ltln$',X2))
| ~ 'member$'(X2,'g$'(X3,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,plain,
'f_G$'('phi$','w$') = 'g$'('phi$','suffix$'('eps$'('uu$'),'w$')),
inference(split_conjunct,[status(thm)],[axiom34]) ).
tcf(c_0_9,negated_conjecture,
~ 'fun_app$a'('semantics_ltln$'('suffix$'('eps$'('uu$'),'w$')),'release_ltln$'('false_ltln$','weakUntil_ltln$'('psi_1$','psi_2$'))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X2: 'A_ltln$'] :
( 'fun_app$a'('semantics_ltln$'('suffix$'('eps$'('uu$'),'w$')),'release_ltln$'('false_ltln$',X2))
| ~ 'member$'(X2,'f_G$'('phi$','w$')) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_11,plain,
'member$'('weakUntil_ltln$'('psi_1$','psi_2$'),'f_G$'('phi$','w$')),
inference(split_conjunct,[status(thm)],[axiom32]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ITP001_1 : TPTP v8.2.0. Released v8.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 17:14:22 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --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.50/0.61 # Version: 3.1.0
% 0.50/0.61 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.50/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.50/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.50/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.61 # Starting sh5l with 300s (1) cores
% 0.50/0.61 # new_bool_3 with pid 27954 completed with status 0
% 0.50/0.61 # Result found by new_bool_3
% 0.50/0.61 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.50/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.50/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.50/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.61 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.50/0.61 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.50/0.61 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 300s (1) cores
% 0.50/0.61 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S0V with 75s (1) cores
% 0.50/0.61 # G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with pid 27958 completed with status 0
% 0.50/0.61 # Result found by G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 0.50/0.61 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.50/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.50/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.50/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.61 # Search class: FGHSM-FSLS32-MFFFFFNN
% 0.50/0.61 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.50/0.61 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 300s (1) cores
% 0.50/0.61 # Preprocessing time : 0.005 s
% 0.50/0.61
% 0.50/0.61 # Proof found!
% 0.50/0.61 # SZS status Theorem
% 0.50/0.61 # SZS output start CNFRefutation
% See solution above
% 0.50/0.61 # Parsed axioms : 788
% 0.50/0.61 # Removed by relevancy pruning/SinE : 482
% 0.50/0.61 # Initial clauses : 771
% 0.50/0.61 # Removed in clause preprocessing : 270
% 0.50/0.61 # Initial clauses in saturation : 501
% 0.50/0.61 # Processed clauses : 614
% 0.50/0.61 # ...of these trivial : 20
% 0.50/0.61 # ...subsumed : 199
% 0.50/0.61 # ...remaining for further processing : 395
% 0.50/0.61 # Other redundant clauses eliminated : 71
% 0.50/0.61 # Clauses deleted for lack of memory : 0
% 0.50/0.61 # Backward-subsumed : 0
% 0.50/0.61 # Backward-rewritten : 5
% 0.50/0.61 # Generated clauses : 1482
% 0.50/0.61 # ...of the previous two non-redundant : 1299
% 0.50/0.61 # ...aggressively subsumed : 0
% 0.50/0.61 # Contextual simplify-reflections : 1
% 0.50/0.61 # Paramodulations : 1389
% 0.50/0.61 # Factorizations : 10
% 0.50/0.61 # NegExts : 0
% 0.50/0.61 # Equation resolutions : 83
% 0.50/0.61 # Disequality decompositions : 0
% 0.50/0.61 # Total rewrite steps : 198
% 0.50/0.61 # ...of those cached : 124
% 0.50/0.61 # Propositional unsat checks : 0
% 0.50/0.61 # Propositional check models : 0
% 0.50/0.61 # Propositional check unsatisfiable : 0
% 0.50/0.61 # Propositional clauses : 0
% 0.50/0.61 # Propositional clauses after purity: 0
% 0.50/0.61 # Propositional unsat core size : 0
% 0.50/0.61 # Propositional preprocessing time : 0.000
% 0.50/0.61 # Propositional encoding time : 0.000
% 0.50/0.61 # Propositional solver time : 0.000
% 0.50/0.61 # Success case prop preproc time : 0.000
% 0.50/0.61 # Success case prop encoding time : 0.000
% 0.50/0.61 # Success case prop solver time : 0.000
% 0.50/0.61 # Current number of processed clauses : 319
% 0.50/0.61 # Positive orientable unit clauses : 38
% 0.50/0.61 # Positive unorientable unit clauses: 0
% 0.50/0.61 # Negative unit clauses : 71
% 0.50/0.61 # Non-unit-clauses : 210
% 0.50/0.61 # Current number of unprocessed clauses: 1171
% 0.50/0.61 # ...number of literals in the above : 3033
% 0.50/0.61 # Current number of archived formulas : 0
% 0.50/0.61 # Current number of archived clauses : 5
% 0.50/0.61 # Clause-clause subsumption calls (NU) : 9710
% 0.50/0.61 # Rec. Clause-clause subsumption calls : 6992
% 0.50/0.61 # Non-unit clause-clause subsumptions : 155
% 0.50/0.61 # Unit Clause-clause subsumption calls : 4453
% 0.50/0.61 # Rewrite failures with RHS unbound : 0
% 0.50/0.61 # BW rewrite match attempts : 4
% 0.50/0.61 # BW rewrite match successes : 3
% 0.50/0.61 # Condensation attempts : 614
% 0.50/0.61 # Condensation successes : 9
% 0.50/0.61 # Termbank termtop insertions : 68718
% 0.50/0.61 # Search garbage collected termcells : 14073
% 0.50/0.61
% 0.50/0.61 # -------------------------------------------------
% 0.50/0.61 # User time : 0.064 s
% 0.50/0.61 # System time : 0.014 s
% 0.50/0.61 # Total time : 0.078 s
% 0.50/0.61 # Maximum resident set size: 5064 pages
% 0.50/0.61
% 0.50/0.61 # -------------------------------------------------
% 0.50/0.61 # User time : 0.127 s
% 0.50/0.61 # System time : 0.025 s
% 0.50/0.61 # Total time : 0.151 s
% 0.50/0.61 # Maximum resident set size: 3356 pages
% 0.50/0.61 % E---3.1 exiting
% 0.50/0.61 % E exiting
%------------------------------------------------------------------------------