TSTP Solution File: CSR075+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR075+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:14:09 EDT 2024
% Result : Theorem 10.91s 2.28s
% Output : CNFRefutation 10.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 24 ~; 20 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 31 ( 3 sgn 13 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) )
=> ( ( s__subclass(X6,X7)
& s__instance(X8,X6) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(prove_from_SUMO,conjecture,
? [X591] : s__member(X591,s__Org1_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_630,axiom,
! [X85] :
( s__instance(X85,s__Collection)
=> ? [X51] :
( s__instance(X51,s__SelfConnectedObject)
& s__member(X51,X85) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_630) ).
fof(kb_SUMO_6547,axiom,
s__subclass(s__Group,s__Collection),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6547) ).
fof(kb_SUMO_6696,axiom,
s__subclass(s__Organization,s__Group),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6696) ).
fof(local_1,axiom,
s__instance(s__Org1_1,s__Organization),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_7,plain,
! [X671,X672,X673] :
( ~ s__instance(X672,s__SetOrClass)
| ~ s__instance(X671,s__SetOrClass)
| ~ s__subclass(X671,X672)
| ~ s__instance(X673,X671)
| s__instance(X673,X672) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_8,plain,
! [X669,X670] :
( ( s__instance(X669,s__SetOrClass)
| ~ s__subclass(X669,X670) )
& ( s__instance(X670,s__SetOrClass)
| ~ s__subclass(X669,X670) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
fof(c_0_9,negated_conjecture,
~ ? [X591] : s__member(X591,s__Org1_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
cnf(c_0_10,plain,
( s__instance(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
! [X592] : ~ s__member(X592,s__Org1_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_14,plain,
! [X595] :
( ( s__instance(esk1_1(X595),s__SelfConnectedObject)
| ~ s__instance(X595,s__Collection) )
& ( s__member(esk1_1(X595),X595)
| ~ s__instance(X595,s__Collection) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_630])])])])]) ).
cnf(c_0_15,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
s__subclass(s__Group,s__Collection),
inference(split_conjunct,[status(thm)],[kb_SUMO_6547]) ).
cnf(c_0_17,plain,
s__subclass(s__Organization,s__Group),
inference(split_conjunct,[status(thm)],[kb_SUMO_6696]) ).
cnf(c_0_18,negated_conjecture,
~ s__member(X1,s__Org1_1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( s__member(esk1_1(X1),X1)
| ~ s__instance(X1,s__Collection) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( s__instance(X1,s__Collection)
| ~ s__instance(X1,s__Group) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( s__instance(X1,s__Group)
| ~ s__instance(X1,s__Organization) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ s__instance(s__Org1_1,s__Collection),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( s__instance(X1,s__Collection)
| ~ s__instance(X1,s__Organization) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
s__instance(s__Org1_1,s__Organization),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR075+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 01:49:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 10.91/2.28 # Version: 3.1.0
% 10.91/2.28 # Preprocessing class: FMLLSMSLSSSNFFN.
% 10.91/2.28 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.91/2.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 10.91/2.28 # Starting new_bool_3 with 300s (1) cores
% 10.91/2.28 # Starting new_bool_1 with 300s (1) cores
% 10.91/2.28 # Starting sh5l with 300s (1) cores
% 10.91/2.28 # sh5l with pid 6017 completed with status 0
% 10.91/2.28 # Result found by sh5l
% 10.91/2.28 # Preprocessing class: FMLLSMSLSSSNFFN.
% 10.91/2.28 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.91/2.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 10.91/2.28 # Starting new_bool_3 with 300s (1) cores
% 10.91/2.28 # Starting new_bool_1 with 300s (1) cores
% 10.91/2.28 # Starting sh5l with 300s (1) cores
% 10.91/2.28 # SinE strategy is gf500_gu_R04_F100_L20000
% 10.91/2.28 # Search class: FGHSM-SMLM31-MFFFFFNN
% 10.91/2.28 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.91/2.28 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 10.91/2.28 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 6020 completed with status 0
% 10.91/2.28 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 10.91/2.28 # Preprocessing class: FMLLSMSLSSSNFFN.
% 10.91/2.28 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.91/2.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 10.91/2.28 # Starting new_bool_3 with 300s (1) cores
% 10.91/2.28 # Starting new_bool_1 with 300s (1) cores
% 10.91/2.28 # Starting sh5l with 300s (1) cores
% 10.91/2.28 # SinE strategy is gf500_gu_R04_F100_L20000
% 10.91/2.28 # Search class: FGHSM-SMLM31-MFFFFFNN
% 10.91/2.28 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.91/2.28 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 10.91/2.28 # Preprocessing time : 0.029 s
% 10.91/2.28 # Presaturation interreduction done
% 10.91/2.28
% 10.91/2.28 # Proof found!
% 10.91/2.28 # SZS status Theorem
% 10.91/2.28 # SZS output start CNFRefutation
% See solution above
% 10.91/2.28 # Parsed axioms : 7219
% 10.91/2.28 # Removed by relevancy pruning/SinE : 4694
% 10.91/2.28 # Initial clauses : 3097
% 10.91/2.28 # Removed in clause preprocessing : 58
% 10.91/2.28 # Initial clauses in saturation : 3039
% 10.91/2.28 # Processed clauses : 10512
% 10.91/2.28 # ...of these trivial : 465
% 10.91/2.28 # ...subsumed : 502
% 10.91/2.28 # ...remaining for further processing : 9545
% 10.91/2.28 # Other redundant clauses eliminated : 86
% 10.91/2.28 # Clauses deleted for lack of memory : 0
% 10.91/2.28 # Backward-subsumed : 62
% 10.91/2.28 # Backward-rewritten : 1143
% 10.91/2.28 # Generated clauses : 20875
% 10.91/2.28 # ...of the previous two non-redundant : 18402
% 10.91/2.28 # ...aggressively subsumed : 0
% 10.91/2.28 # Contextual simplify-reflections : 369
% 10.91/2.28 # Paramodulations : 20787
% 10.91/2.28 # Factorizations : 8
% 10.91/2.28 # NegExts : 0
% 10.91/2.28 # Equation resolutions : 87
% 10.91/2.28 # Disequality decompositions : 0
% 10.91/2.28 # Total rewrite steps : 3282
% 10.91/2.28 # ...of those cached : 1644
% 10.91/2.28 # Propositional unsat checks : 1
% 10.91/2.28 # Propositional check models : 1
% 10.91/2.28 # Propositional check unsatisfiable : 0
% 10.91/2.28 # Propositional clauses : 0
% 10.91/2.28 # Propositional clauses after purity: 0
% 10.91/2.28 # Propositional unsat core size : 0
% 10.91/2.28 # Propositional preprocessing time : 0.000
% 10.91/2.28 # Propositional encoding time : 0.010
% 10.91/2.28 # Propositional solver time : 0.006
% 10.91/2.28 # Success case prop preproc time : 0.000
% 10.91/2.28 # Success case prop encoding time : 0.000
% 10.91/2.28 # Success case prop solver time : 0.000
% 10.91/2.28 # Current number of processed clauses : 5354
% 10.91/2.28 # Positive orientable unit clauses : 1772
% 10.91/2.28 # Positive unorientable unit clauses: 9
% 10.91/2.28 # Negative unit clauses : 197
% 10.91/2.28 # Non-unit-clauses : 3376
% 10.91/2.28 # Current number of unprocessed clauses: 11129
% 10.91/2.28 # ...number of literals in the above : 45858
% 10.91/2.28 # Current number of archived formulas : 0
% 10.91/2.28 # Current number of archived clauses : 4145
% 10.91/2.28 # Clause-clause subsumption calls (NU) : 2477223
% 10.91/2.28 # Rec. Clause-clause subsumption calls : 779287
% 10.91/2.28 # Non-unit clause-clause subsumptions : 907
% 10.91/2.28 # Unit Clause-clause subsumption calls : 832849
% 10.91/2.28 # Rewrite failures with RHS unbound : 37
% 10.91/2.28 # BW rewrite match attempts : 1619
% 10.91/2.28 # BW rewrite match successes : 842
% 10.91/2.28 # Condensation attempts : 0
% 10.91/2.28 # Condensation successes : 0
% 10.91/2.28 # Termbank termtop insertions : 618066
% 10.91/2.28 # Search garbage collected termcells : 69827
% 10.91/2.28
% 10.91/2.28 # -------------------------------------------------
% 10.91/2.28 # User time : 1.560 s
% 10.91/2.28 # System time : 0.065 s
% 10.91/2.28 # Total time : 1.625 s
% 10.91/2.28 # Maximum resident set size: 22976 pages
% 10.91/2.28
% 10.91/2.28 # -------------------------------------------------
% 10.91/2.28 # User time : 1.693 s
% 10.91/2.28 # System time : 0.076 s
% 10.91/2.28 # Total time : 1.768 s
% 10.91/2.28 # Maximum resident set size: 9056 pages
% 10.91/2.28 % E---3.1 exiting
% 10.91/2.28 % E exiting
%------------------------------------------------------------------------------