TSTP Solution File: ALG211+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG211+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 18:12:42 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 89 ( 37 ~; 31 |; 13 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 58 ( 6 sgn 28 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(bg_2_4_3,conjecture,
! [X7,X2] :
( ( a_vector_subspace_of(X7,X2)
& a_vector_space(X2) )
=> ? [X8,X9] :
( basis_of(union(X8,X9),X2)
& basis_of(X8,X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bg_2_4_3) ).
fof(bg_2_4_2,axiom,
! [X7,X2,X8] :
( ( a_vector_subspace_of(X7,X2)
& a_subset_of(X8,vec_to_class(X7)) )
=> ( lin_ind_subset(X8,X7)
<=> lin_ind_subset(X8,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bg_2_4_2) ).
fof(basis_of,axiom,
! [X1,X2] :
( basis_of(X1,X2)
=> ( lin_ind_subset(X1,X2)
& a_subset_of(X1,vec_to_class(X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',basis_of) ).
fof(bg_2_2_5,axiom,
! [X3,X4,X2] :
( ( lin_ind_subset(X3,X2)
& basis_of(X4,X2) )
=> ? [X5] :
( a_subset_of(X5,X4)
& basis_of(union(X3,X5),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bg_2_2_5) ).
fof(bg_2_4_a,axiom,
! [X6,X1] :
( a_vector_subspace_of(X6,X1)
=> a_vector_space(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bg_2_4_a) ).
fof(bg_remark_63_a,axiom,
! [X6] :
( a_vector_space(X6)
=> ? [X1] : basis_of(X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bg_remark_63_a) ).
fof(c_0_6,negated_conjecture,
~ ! [X7,X2] :
( ( a_vector_subspace_of(X7,X2)
& a_vector_space(X2) )
=> ? [X8,X9] :
( basis_of(union(X8,X9),X2)
& basis_of(X8,X7) ) ),
inference(assume_negation,[status(cth)],[bg_2_4_3]) ).
fof(c_0_7,plain,
! [X20,X21,X22] :
( ( ~ lin_ind_subset(X22,X20)
| lin_ind_subset(X22,X21)
| ~ a_vector_subspace_of(X20,X21)
| ~ a_subset_of(X22,vec_to_class(X20)) )
& ( ~ lin_ind_subset(X22,X21)
| lin_ind_subset(X22,X20)
| ~ a_vector_subspace_of(X20,X21)
| ~ a_subset_of(X22,vec_to_class(X20)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[bg_2_4_2])])])]) ).
fof(c_0_8,plain,
! [X10,X11] :
( ( lin_ind_subset(X10,X11)
| ~ basis_of(X10,X11) )
& ( a_subset_of(X10,vec_to_class(X11))
| ~ basis_of(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[basis_of])])])]) ).
fof(c_0_9,negated_conjecture,
! [X25,X26] :
( a_vector_subspace_of(esk3_0,esk4_0)
& a_vector_space(esk4_0)
& ( ~ basis_of(union(X25,X26),esk4_0)
| ~ basis_of(X25,esk3_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_10,plain,
! [X12,X13,X14] :
( ( a_subset_of(esk1_3(X12,X13,X14),X13)
| ~ lin_ind_subset(X12,X14)
| ~ basis_of(X13,X14) )
& ( basis_of(union(X12,esk1_3(X12,X13,X14)),X14)
| ~ lin_ind_subset(X12,X14)
| ~ basis_of(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[bg_2_2_5])])])])]) ).
cnf(c_0_11,plain,
( lin_ind_subset(X1,X3)
| ~ lin_ind_subset(X1,X2)
| ~ a_vector_subspace_of(X2,X3)
| ~ a_subset_of(X1,vec_to_class(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( a_subset_of(X1,vec_to_class(X2))
| ~ basis_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( lin_ind_subset(X1,X2)
| ~ basis_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ basis_of(union(X1,X2),esk4_0)
| ~ basis_of(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( basis_of(union(X1,esk1_3(X1,X2,X3)),X3)
| ~ lin_ind_subset(X1,X3)
| ~ basis_of(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( lin_ind_subset(X1,X2)
| ~ a_vector_subspace_of(X3,X2)
| ~ basis_of(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
a_vector_subspace_of(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X18,X19] :
( ~ a_vector_subspace_of(X18,X19)
| a_vector_space(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[bg_2_4_a])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ lin_ind_subset(X1,esk4_0)
| ~ basis_of(X1,esk3_0)
| ~ basis_of(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( lin_ind_subset(X1,esk4_0)
| ~ basis_of(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X16] :
( ~ a_vector_space(X16)
| basis_of(esk2_1(X16),X16) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[bg_remark_63_a])])])]) ).
cnf(c_0_22,plain,
( a_vector_space(X1)
| ~ a_vector_subspace_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ basis_of(X1,esk3_0)
| ~ basis_of(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( basis_of(esk2_1(X1),X1)
| ~ a_vector_space(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
a_vector_space(esk3_0),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
~ basis_of(X1,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_27,negated_conjecture,
a_vector_space(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ALG211+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 22:54:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.49 Running first-order model finding
% 0.19/0.49 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/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9489 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FHHNF-FFSF31-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.51 # Starting sh5l with 136s (1) cores
% 0.19/0.51 # SAT001_MinMin_p005000_rr_RG with pid 9494 completed with status 0
% 0.19/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FHHNF-FFSF31-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 6
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 11
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 11
% 0.19/0.51 # Processed clauses : 32
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 1
% 0.19/0.51 # ...remaining for further processing : 31
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 6
% 0.19/0.51 # Backward-rewritten : 0
% 0.19/0.51 # Generated clauses : 15
% 0.19/0.51 # ...of the previous two non-redundant : 13
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 1
% 0.19/0.51 # Paramodulations : 15
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 3
% 0.19/0.51 # ...of those cached : 1
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 14
% 0.19/0.51 # Positive orientable unit clauses : 3
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 10
% 0.19/0.51 # Current number of unprocessed clauses: 3
% 0.19/0.51 # ...number of literals in the above : 13
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 17
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 72
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 49
% 0.19/0.51 # Non-unit clause-clause subsumptions : 6
% 0.19/0.51 # Unit Clause-clause subsumption calls : 9
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 0
% 0.19/0.51 # BW rewrite match successes : 0
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 1031
% 0.19/0.51 # Search garbage collected termcells : 181
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.006 s
% 0.19/0.51 # System time : 0.001 s
% 0.19/0.51 # Total time : 0.007 s
% 0.19/0.51 # Maximum resident set size: 1752 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.014 s
% 0.19/0.51 # System time : 0.008 s
% 0.19/0.51 # Total time : 0.022 s
% 0.19/0.51 # Maximum resident set size: 1696 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------