TSTP Solution File: CSR073+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR073+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:35:49 EDT 2024
% Result : Theorem 0.71s 0.61s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 20 ~; 16 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 39 ( 2 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query123,conjecture,
? [X5] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X5,c_pushingababycarriage) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',query123) ).
fof(ax1_409,axiom,
! [X5,X6] :
( tptptypes_7_396(X5,X6)
=> tptptypes_6_388(X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_409) ).
fof(ax1_174,axiom,
! [X5,X6] :
( tptptypes_8_400(X5,X6)
=> tptptypes_7_396(X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_174) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_1123) ).
fof(ax1_108,axiom,
! [X5,X6] :
( tptptypes_9_401(X5,X6)
=> tptptypes_8_400(X6,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_108) ).
fof(ax1_157,axiom,
( mtvisible(c_tptp_member237_mt)
=> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_157) ).
fof(ax1_198,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_198) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.XCb9p413yB/E---3.1_21793.p',ax1_99) ).
fof(c_0_8,negated_conjecture,
~ ? [X5] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X5,c_pushingababycarriage) ),
inference(assume_negation,[status(cth)],[query123]) ).
fof(c_0_9,plain,
! [X35,X36] :
( ~ tptptypes_7_396(X35,X36)
| tptptypes_6_388(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_409])])]) ).
fof(c_0_10,plain,
! [X65,X66] :
( ~ tptptypes_8_400(X65,X66)
| tptptypes_7_396(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_174])])]) ).
fof(c_0_11,plain,
! [X31,X32] :
( ~ mtvisible(X31)
| ~ genlmt(X31,X32)
| mtvisible(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
fof(c_0_12,negated_conjecture,
! [X22] :
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptptypes_5_387(X22,c_pushingababycarriage) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X41,X42] :
( ~ tptptypes_9_401(X41,X42)
| tptptypes_8_400(X42,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_108])])]) ).
fof(c_0_16,plain,
( ~ mtvisible(c_tptp_member237_mt)
| tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_157])]) ).
cnf(c_0_17,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
inference(split_conjunct,[status(thm)],[ax1_198]) ).
cnf(c_0_19,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,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])])]) ).
cnf(c_0_21,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( tptptypes_8_400(X2,X1)
| ~ tptptypes_9_401(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
mtvisible(c_tptp_member237_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : CSR073+2 : TPTP v8.1.2. Released v3.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n009.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 : Fri May 3 15:12:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 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/tmp/tmp.XCb9p413yB/E---3.1_21793.p
% 0.71/0.61 # Version: 3.1.0
% 0.71/0.61 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.71/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.61 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.71/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.71/0.61 # Starting new_bool_1 with 600s (2) cores
% 0.71/0.61 # Starting sh5l with 300s (1) cores
% 0.71/0.61 # sh5l with pid 21875 completed with status 0
% 0.71/0.61 # Result found by sh5l
% 0.71/0.61 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.71/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.61 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.71/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.71/0.61 # Starting new_bool_1 with 600s (2) cores
% 0.71/0.61 # Starting sh5l with 300s (1) cores
% 0.71/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.71/0.61 # Search class: FHHNM-FSMM31-SFFFFFNN
% 0.71/0.61 # partial match(2): FGHSM-FSMM31-SFFFFFNN
% 0.71/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 181s (1) cores
% 0.71/0.61 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 21880 completed with status 0
% 0.71/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.71/0.61 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.71/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.61 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.71/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.71/0.61 # Starting new_bool_1 with 600s (2) cores
% 0.71/0.61 # Starting sh5l with 300s (1) cores
% 0.71/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.71/0.61 # Search class: FHHNM-FSMM31-SFFFFFNN
% 0.71/0.61 # partial match(2): FGHSM-FSMM31-SFFFFFNN
% 0.71/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 181s (1) cores
% 0.71/0.61 # Preprocessing time : 0.006 s
% 0.71/0.61 # Presaturation interreduction done
% 0.71/0.61
% 0.71/0.61 # Proof found!
% 0.71/0.61 # SZS status Theorem
% 0.71/0.61 # SZS output start CNFRefutation
% See solution above
% 0.71/0.61 # Parsed axioms : 1132
% 0.71/0.61 # Removed by relevancy pruning/SinE : 887
% 0.71/0.61 # Initial clauses : 246
% 0.71/0.61 # Removed in clause preprocessing : 0
% 0.71/0.61 # Initial clauses in saturation : 246
% 0.71/0.61 # Processed clauses : 912
% 0.71/0.61 # ...of these trivial : 11
% 0.71/0.61 # ...subsumed : 37
% 0.71/0.61 # ...remaining for further processing : 864
% 0.71/0.61 # Other redundant clauses eliminated : 0
% 0.71/0.61 # Clauses deleted for lack of memory : 0
% 0.71/0.61 # Backward-subsumed : 1
% 0.71/0.61 # Backward-rewritten : 21
% 0.71/0.61 # Generated clauses : 962
% 0.71/0.61 # ...of the previous two non-redundant : 628
% 0.71/0.61 # ...aggressively subsumed : 0
% 0.71/0.61 # Contextual simplify-reflections : 0
% 0.71/0.61 # Paramodulations : 962
% 0.71/0.61 # Factorizations : 0
% 0.71/0.61 # NegExts : 0
% 0.71/0.61 # Equation resolutions : 0
% 0.71/0.61 # Disequality decompositions : 0
% 0.71/0.61 # Total rewrite steps : 281
% 0.71/0.61 # ...of those cached : 183
% 0.71/0.61 # Propositional unsat checks : 0
% 0.71/0.61 # Propositional check models : 0
% 0.71/0.61 # Propositional check unsatisfiable : 0
% 0.71/0.61 # Propositional clauses : 0
% 0.71/0.61 # Propositional clauses after purity: 0
% 0.71/0.61 # Propositional unsat core size : 0
% 0.71/0.61 # Propositional preprocessing time : 0.000
% 0.71/0.61 # Propositional encoding time : 0.000
% 0.71/0.61 # Propositional solver time : 0.000
% 0.71/0.61 # Success case prop preproc time : 0.000
% 0.71/0.61 # Success case prop encoding time : 0.000
% 0.71/0.61 # Success case prop solver time : 0.000
% 0.71/0.61 # Current number of processed clauses : 606
% 0.71/0.61 # Positive orientable unit clauses : 314
% 0.71/0.61 # Positive unorientable unit clauses: 0
% 0.71/0.61 # Negative unit clauses : 36
% 0.71/0.61 # Non-unit-clauses : 256
% 0.71/0.61 # Current number of unprocessed clauses: 161
% 0.71/0.61 # ...number of literals in the above : 327
% 0.71/0.61 # Current number of archived formulas : 0
% 0.71/0.61 # Current number of archived clauses : 258
% 0.71/0.61 # Clause-clause subsumption calls (NU) : 16902
% 0.71/0.61 # Rec. Clause-clause subsumption calls : 15190
% 0.71/0.61 # Non-unit clause-clause subsumptions : 22
% 0.71/0.61 # Unit Clause-clause subsumption calls : 3536
% 0.71/0.61 # Rewrite failures with RHS unbound : 0
% 0.71/0.61 # BW rewrite match attempts : 9
% 0.71/0.61 # BW rewrite match successes : 9
% 0.71/0.61 # Condensation attempts : 0
% 0.71/0.61 # Condensation successes : 0
% 0.71/0.61 # Termbank termtop insertions : 26318
% 0.71/0.61 # Search garbage collected termcells : 5239
% 0.71/0.61
% 0.71/0.61 # -------------------------------------------------
% 0.71/0.61 # User time : 0.064 s
% 0.71/0.61 # System time : 0.008 s
% 0.71/0.61 # Total time : 0.072 s
% 0.71/0.61 # Maximum resident set size: 4640 pages
% 0.71/0.61
% 0.71/0.61 # -------------------------------------------------
% 0.71/0.61 # User time : 0.075 s
% 0.71/0.61 # System time : 0.009 s
% 0.71/0.61 # Total time : 0.084 s
% 0.71/0.61 # Maximum resident set size: 2660 pages
% 0.71/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------