TSTP Solution File: ALG211+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG211+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 : 600s
% DateTime : Thu Jul 14 15:33:00 EDT 2022
% Result : Theorem 7.78s 2.25s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 7 unt; 0 nHn; 24 RR)
% Number of literals : 48 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 2 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 : 37 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( lin_ind_subset(X1,X2)
| ~ lin_ind_subset(X1,X3)
| ~ a_vector_subspace_of(X3,X2)
| ~ a_subset_of(X1,vec_to_class(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_8) ).
cnf(i_0_1,plain,
( a_subset_of(X1,vec_to_class(X2))
| ~ basis_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
( lin_ind_subset(X1,X2)
| ~ basis_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_2) ).
cnf(i_0_11,negated_conjecture,
a_vector_subspace_of(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_11) ).
cnf(i_0_9,negated_conjecture,
( ~ basis_of(X1,esk3_0)
| ~ basis_of(union(X1,X2),esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_9) ).
cnf(i_0_3,plain,
( basis_of(union(X1,esk1_3(X1,X2,X3)),X3)
| ~ basis_of(X2,X3)
| ~ lin_ind_subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_3) ).
cnf(i_0_6,plain,
( a_vector_space(X1)
| ~ a_vector_subspace_of(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
( basis_of(esk2_1(X1),X1)
| ~ a_vector_space(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_5) ).
cnf(i_0_10,negated_conjecture,
a_vector_space(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0n8_qdn3/lgb.p',i_0_10) ).
cnf(c_0_21,plain,
( lin_ind_subset(X1,X2)
| ~ lin_ind_subset(X1,X3)
| ~ a_vector_subspace_of(X3,X2)
| ~ a_subset_of(X1,vec_to_class(X3)) ),
i_0_8 ).
cnf(c_0_22,plain,
( a_subset_of(X1,vec_to_class(X2))
| ~ basis_of(X1,X2) ),
i_0_1 ).
cnf(c_0_23,plain,
( lin_ind_subset(X1,X2)
| ~ basis_of(X1,X2) ),
i_0_2 ).
cnf(c_0_24,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_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,negated_conjecture,
a_vector_subspace_of(esk3_0,esk4_0),
i_0_11 ).
cnf(c_0_26,negated_conjecture,
( ~ basis_of(X1,esk3_0)
| ~ basis_of(union(X1,X2),esk4_0) ),
i_0_9 ).
cnf(c_0_27,plain,
( basis_of(union(X1,esk1_3(X1,X2,X3)),X3)
| ~ basis_of(X2,X3)
| ~ lin_ind_subset(X1,X3) ),
i_0_3 ).
cnf(c_0_28,negated_conjecture,
( lin_ind_subset(X1,esk4_0)
| ~ basis_of(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( a_vector_space(X1)
| ~ a_vector_subspace_of(X1,X2) ),
i_0_6 ).
cnf(c_0_30,negated_conjecture,
( ~ basis_of(X1,esk3_0)
| ~ basis_of(X2,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
( basis_of(esk2_1(X1),X1)
| ~ a_vector_space(X1) ),
i_0_5 ).
cnf(c_0_32,negated_conjecture,
a_vector_space(esk3_0),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_33,plain,
~ basis_of(X1,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
a_vector_space(esk4_0),
i_0_10 ).
cnf(c_0_35,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ALG211+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 8 06:44:51 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.78/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.78/2.25 # No SInE strategy applied
% 7.78/2.25 # Trying AutoSched0 for 150 seconds
% 7.78/2.25 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.78/2.25 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.78/2.25 #
% 7.78/2.25 # Preprocessing time : 0.022 s
% 7.78/2.25 # Presaturation interreduction done
% 7.78/2.25
% 7.78/2.25 # Proof found!
% 7.78/2.25 # SZS status Theorem
% 7.78/2.25 # SZS output start CNFRefutation
% See solution above
% 7.78/2.25 # Training examples: 0 positive, 0 negative
% 7.78/2.25
% 7.78/2.25 # -------------------------------------------------
% 7.78/2.25 # User time : 0.025 s
% 7.78/2.25 # System time : 0.003 s
% 7.78/2.25 # Total time : 0.028 s
% 7.78/2.25 # Maximum resident set size: 7120 pages
% 7.78/2.25
%------------------------------------------------------------------------------