TSTP Solution File: CSR030+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR030+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Sat May 4 07:31:24 EDT 2024
% Result : Theorem 0.37s 0.62s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 15 ~; 10 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 24 ( 3 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query80,conjecture,
? [X6] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X6,c_pushingwithopenhand) ),
file('/export/starexec/sandbox/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p',query80) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p',ax1_1123) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p',ax1_99) ).
fof(ax1_451,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/export/starexec/sandbox/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p',ax1_451) ).
fof(ax1_133,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p',ax1_133) ).
fof(ax1_302,axiom,
! [X5,X6] :
( tptptypes_7_389(X5,X6)
=> tptptypes_6_388(X6,X5) ),
file('/export/starexec/sandbox/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p',ax1_302) ).
fof(c_0_6,negated_conjecture,
~ ? [X6] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X6,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[query80]) ).
fof(c_0_7,plain,
! [X29,X30] :
( ~ mtvisible(X29)
| ~ genlmt(X29,X30)
| mtvisible(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
fof(c_0_8,negated_conjecture,
! [X22] :
( mtvisible(c_tptp_member3393_mt)
& ~ tptptypes_5_387(X22,c_pushingwithopenhand) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X23,X24] :
( ~ tptptypes_6_388(X23,X24)
| tptptypes_5_387(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_99])])]) ).
fof(c_0_10,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_451])]) ).
cnf(c_0_11,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_133]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X31,X32] :
( ~ tptptypes_7_389(X31,X32)
| tptptypes_6_388(X32,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_302])])]) ).
cnf(c_0_17,plain,
( tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.18 % Problem : CSR030+2 : TPTP v8.1.2. Released v3.4.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n014.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 300
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Fri May 3 14:37:08 EDT 2024
% 0.19/0.40 % CPUTime :
% 0.37/0.59 Running first-order theorem proving
% 0.37/0.59 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/tmp/tmp.eH0gHc3TYL/E---3.1_1426.p
% 0.37/0.62 # Version: 3.1.0
% 0.37/0.62 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.37/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.37/0.62 # Starting new_bool_3 with 600s (2) cores
% 0.37/0.62 # Starting new_bool_1 with 600s (2) cores
% 0.37/0.62 # Starting sh5l with 300s (1) cores
% 0.37/0.62 # new_bool_3 with pid 1506 completed with status 0
% 0.37/0.62 # Result found by new_bool_3
% 0.37/0.62 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.37/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.37/0.62 # Starting new_bool_3 with 600s (2) cores
% 0.37/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.62 # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.37/0.62 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.37/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.37/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.37/0.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1511 completed with status 0
% 0.37/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.37/0.62 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.37/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.62 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.37/0.62 # Starting new_bool_3 with 600s (2) cores
% 0.37/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.62 # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.37/0.62 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.37/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.37/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.37/0.62 # Preprocessing time : 0.003 s
% 0.37/0.62 # Presaturation interreduction done
% 0.37/0.62
% 0.37/0.62 # Proof found!
% 0.37/0.62 # SZS status Theorem
% 0.37/0.62 # SZS output start CNFRefutation
% See solution above
% 0.37/0.62 # Parsed axioms : 1132
% 0.37/0.62 # Removed by relevancy pruning/SinE : 1109
% 0.37/0.62 # Initial clauses : 24
% 0.37/0.62 # Removed in clause preprocessing : 0
% 0.37/0.62 # Initial clauses in saturation : 24
% 0.37/0.62 # Processed clauses : 57
% 0.37/0.62 # ...of these trivial : 0
% 0.37/0.62 # ...subsumed : 0
% 0.37/0.62 # ...remaining for further processing : 57
% 0.37/0.62 # Other redundant clauses eliminated : 0
% 0.37/0.62 # Clauses deleted for lack of memory : 0
% 0.37/0.62 # Backward-subsumed : 0
% 0.37/0.62 # Backward-rewritten : 2
% 0.37/0.62 # Generated clauses : 17
% 0.37/0.62 # ...of the previous two non-redundant : 16
% 0.37/0.62 # ...aggressively subsumed : 0
% 0.37/0.62 # Contextual simplify-reflections : 0
% 0.37/0.62 # Paramodulations : 16
% 0.37/0.62 # Factorizations : 0
% 0.37/0.62 # NegExts : 0
% 0.37/0.62 # Equation resolutions : 0
% 0.37/0.62 # Disequality decompositions : 0
% 0.37/0.62 # Total rewrite steps : 4
% 0.37/0.62 # ...of those cached : 1
% 0.37/0.62 # Propositional unsat checks : 0
% 0.37/0.62 # Propositional check models : 0
% 0.37/0.62 # Propositional check unsatisfiable : 0
% 0.37/0.62 # Propositional clauses : 0
% 0.37/0.62 # Propositional clauses after purity: 0
% 0.37/0.62 # Propositional unsat core size : 0
% 0.37/0.62 # Propositional preprocessing time : 0.000
% 0.37/0.62 # Propositional encoding time : 0.000
% 0.37/0.62 # Propositional solver time : 0.000
% 0.37/0.62 # Success case prop preproc time : 0.000
% 0.37/0.62 # Success case prop encoding time : 0.000
% 0.37/0.62 # Success case prop solver time : 0.000
% 0.37/0.62 # Current number of processed clauses : 30
% 0.37/0.62 # Positive orientable unit clauses : 5
% 0.37/0.62 # Positive unorientable unit clauses: 0
% 0.37/0.62 # Negative unit clauses : 3
% 0.37/0.62 # Non-unit-clauses : 22
% 0.37/0.62 # Current number of unprocessed clauses: 7
% 0.37/0.62 # ...number of literals in the above : 15
% 0.37/0.62 # Current number of archived formulas : 0
% 0.37/0.62 # Current number of archived clauses : 27
% 0.37/0.62 # Clause-clause subsumption calls (NU) : 70
% 0.37/0.62 # Rec. Clause-clause subsumption calls : 46
% 0.37/0.62 # Non-unit clause-clause subsumptions : 0
% 0.37/0.62 # Unit Clause-clause subsumption calls : 19
% 0.37/0.62 # Rewrite failures with RHS unbound : 0
% 0.37/0.62 # BW rewrite match attempts : 1
% 0.37/0.62 # BW rewrite match successes : 1
% 0.37/0.62 # Condensation attempts : 0
% 0.37/0.62 # Condensation successes : 0
% 0.37/0.62 # Termbank termtop insertions : 8611
% 0.37/0.62 # Search garbage collected termcells : 4951
% 0.37/0.62
% 0.37/0.62 # -------------------------------------------------
% 0.37/0.62 # User time : 0.004 s
% 0.37/0.62 # System time : 0.009 s
% 0.37/0.62 # Total time : 0.013 s
% 0.37/0.62 # Maximum resident set size: 4160 pages
% 0.37/0.62
% 0.37/0.62 # -------------------------------------------------
% 0.37/0.62 # User time : 0.019 s
% 0.37/0.62 # System time : 0.016 s
% 0.37/0.62 # Total time : 0.034 s
% 0.37/0.62 # Maximum resident set size: 2656 pages
% 0.37/0.62 % E---3.1 exiting
% 0.37/0.62 % E exiting
%------------------------------------------------------------------------------