TSTP Solution File: CSR030+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR030+3 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 19:13:17 EDT 2024
% Result : Theorem 0.43s 0.68s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 16 ~; 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(query130,conjecture,
? [X4] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X4,c_pushingwithopenhand) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query130) ).
fof(ax2_1143,axiom,
! [X3,X4] :
( tptptypes_6_388(X3,X4)
=> tptptypes_5_387(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1143) ).
fof(ax2_1462,axiom,
! [X3,X4] :
( tptptypes_7_389(X3,X4)
=> tptptypes_6_388(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1462) ).
fof(ax2_900,axiom,
( mtvisible(c_tptp_spindleheadmt)
=> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_900) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_2434,axiom,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2434) ).
fof(c_0_6,negated_conjecture,
~ ? [X4] :
( mtvisible(c_tptp_member3393_mt)
=> tptptypes_5_387(X4,c_pushingwithopenhand) ),
inference(assume_negation,[status(cth)],[query130]) ).
fof(c_0_7,negated_conjecture,
! [X23] :
( mtvisible(c_tptp_member3393_mt)
& ~ tptptypes_5_387(X23,c_pushingwithopenhand) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X26,X27] :
( ~ tptptypes_6_388(X26,X27)
| tptptypes_5_387(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1143])])]) ).
cnf(c_0_9,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithopenhand),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X42,X43] :
( ~ tptptypes_7_389(X42,X43)
| tptptypes_6_388(X43,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1462])])]) ).
cnf(c_0_12,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithopenhand),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_tptp_spindleheadmt)
| tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_900])]) ).
fof(c_0_15,plain,
! [X36,X37] :
( ~ mtvisible(X36)
| ~ genlmt(X36,X37)
| mtvisible(X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
cnf(c_0_16,negated_conjecture,
~ tptptypes_7_389(c_pushingwithopenhand,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
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_14]) ).
cnf(c_0_18,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_2434]) ).
cnf(c_0_20,negated_conjecture,
mtvisible(c_tptp_member3393_mt),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
~ mtvisible(c_tptp_spindleheadmt),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR030+3 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.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 : Sun May 19 02:26:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.43/0.68 # Version: 3.1.0
% 0.43/0.68 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.43/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.68 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.43/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.68 # Starting sh5l with 300s (1) cores
% 0.43/0.68 # sh5l with pid 11226 completed with status 0
% 0.43/0.68 # Result found by sh5l
% 0.43/0.68 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.43/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.68 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.43/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.68 # Starting sh5l with 300s (1) cores
% 0.43/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.43/0.68 # Search class: FHUNS-FFMM21-MFFFFFNN
% 0.43/0.68 # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.43/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.43/0.68 # SAT001_MinMin_p005000_rr_RG with pid 11227 completed with status 0
% 0.43/0.68 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.43/0.68 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.43/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.68 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.43/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.68 # Starting sh5l with 300s (1) cores
% 0.43/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.43/0.68 # Search class: FHUNS-FFMM21-MFFFFFNN
% 0.43/0.68 # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.43/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.43/0.68 # Preprocessing time : 0.008 s
% 0.43/0.68 # Presaturation interreduction done
% 0.43/0.68
% 0.43/0.68 # Proof found!
% 0.43/0.68 # SZS status Theorem
% 0.43/0.68 # SZS output start CNFRefutation
% See solution above
% 0.43/0.68 # Parsed axioms : 8006
% 0.43/0.68 # Removed by relevancy pruning/SinE : 7816
% 0.43/0.68 # Initial clauses : 191
% 0.43/0.68 # Removed in clause preprocessing : 0
% 0.43/0.68 # Initial clauses in saturation : 191
% 0.43/0.68 # Processed clauses : 350
% 0.43/0.68 # ...of these trivial : 24
% 0.43/0.68 # ...subsumed : 14
% 0.43/0.68 # ...remaining for further processing : 312
% 0.43/0.68 # Other redundant clauses eliminated : 0
% 0.43/0.68 # Clauses deleted for lack of memory : 0
% 0.43/0.68 # Backward-subsumed : 8
% 0.43/0.68 # Backward-rewritten : 0
% 0.43/0.68 # Generated clauses : 125
% 0.43/0.68 # ...of the previous two non-redundant : 20
% 0.43/0.68 # ...aggressively subsumed : 0
% 0.43/0.68 # Contextual simplify-reflections : 0
% 0.43/0.68 # Paramodulations : 125
% 0.43/0.68 # Factorizations : 0
% 0.43/0.68 # NegExts : 0
% 0.43/0.68 # Equation resolutions : 0
% 0.43/0.68 # Disequality decompositions : 0
% 0.43/0.68 # Total rewrite steps : 25
% 0.43/0.68 # ...of those cached : 0
% 0.43/0.68 # Propositional unsat checks : 0
% 0.43/0.68 # Propositional check models : 0
% 0.43/0.68 # Propositional check unsatisfiable : 0
% 0.43/0.68 # Propositional clauses : 0
% 0.43/0.68 # Propositional clauses after purity: 0
% 0.43/0.68 # Propositional unsat core size : 0
% 0.43/0.68 # Propositional preprocessing time : 0.000
% 0.43/0.68 # Propositional encoding time : 0.000
% 0.43/0.68 # Propositional solver time : 0.000
% 0.43/0.68 # Success case prop preproc time : 0.000
% 0.43/0.68 # Success case prop encoding time : 0.000
% 0.43/0.68 # Success case prop solver time : 0.000
% 0.43/0.68 # Current number of processed clauses : 147
% 0.43/0.68 # Positive orientable unit clauses : 104
% 0.43/0.68 # Positive unorientable unit clauses: 0
% 0.43/0.68 # Negative unit clauses : 5
% 0.43/0.68 # Non-unit-clauses : 38
% 0.43/0.68 # Current number of unprocessed clauses: 15
% 0.43/0.68 # ...number of literals in the above : 25
% 0.43/0.68 # Current number of archived formulas : 0
% 0.43/0.68 # Current number of archived clauses : 165
% 0.43/0.68 # Clause-clause subsumption calls (NU) : 618
% 0.43/0.68 # Rec. Clause-clause subsumption calls : 546
% 0.43/0.68 # Non-unit clause-clause subsumptions : 14
% 0.43/0.68 # Unit Clause-clause subsumption calls : 142
% 0.43/0.68 # Rewrite failures with RHS unbound : 0
% 0.43/0.68 # BW rewrite match attempts : 2
% 0.43/0.68 # BW rewrite match successes : 0
% 0.43/0.68 # Condensation attempts : 0
% 0.43/0.68 # Condensation successes : 0
% 0.43/0.68 # Termbank termtop insertions : 56739
% 0.43/0.68 # Search garbage collected termcells : 31026
% 0.43/0.68
% 0.43/0.68 # -------------------------------------------------
% 0.43/0.68 # User time : 0.040 s
% 0.43/0.68 # System time : 0.023 s
% 0.43/0.68 # Total time : 0.063 s
% 0.43/0.68 # Maximum resident set size: 18412 pages
% 0.43/0.68
% 0.43/0.68 # -------------------------------------------------
% 0.43/0.68 # User time : 0.138 s
% 0.43/0.68 # System time : 0.035 s
% 0.43/0.68 # Total time : 0.173 s
% 0.43/0.68 # Maximum resident set size: 7952 pages
% 0.43/0.68 % E---3.1 exiting
% 0.74/0.68 % E exiting
%------------------------------------------------------------------------------