TSTP Solution File: MSC013-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MSC013-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.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 : Sun Jul 17 22:43:16 EDT 2022
% Result : Satisfiable 1.49s 0.56s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC013-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n026.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 : 600
% 0.13/0.34 % DateTime : Fri Jul 1 15:23:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 12 Number of unprocessed: 12
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 12 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 1 conjectures.
% 0.19/0.38 # There are 1 start rule candidates:
% 0.19/0.38 # Found 12 unit axioms.
% 0.19/0.38 # 1 start rule tableaux created.
% 0.19/0.38 # 0 extension rule candidate clauses
% 0.19/0.38 # 12 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.38 # Creating equality axioms
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38 # Returning from population with 31 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.38 # We now have 31 tableaux to operate on
% 1.49/0.55 # 23798 Satisfiable branch
% 1.49/0.55 # 23794 Satisfiable branch
% 1.49/0.55 # 23796 Satisfiable branch
% 1.49/0.55 # 23792 Satisfiable branch
% 1.49/0.56 # Satisfiable branch found.
% 1.49/0.56 # There were 1 total branch saturation attempts.
% 1.49/0.56 # There were 0 of these attempts blocked.
% 1.49/0.56 # There were 0 deferred branch saturation attempts.
% 1.49/0.56 # There were 0 free duplicated saturations.
% 1.49/0.56 # There were 0 total successful branch saturations.
% 1.49/0.56 # There were 0 successful branch saturations in interreduction.
% 1.49/0.56 # There were 0 successful branch saturations on the branch.
% 1.49/0.56 # There were 0 successful branch saturations after the branch.
% 1.49/0.56 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.49/0.56 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.49/0.56 # Begin clausification derivation
% 1.49/0.56
% 1.49/0.56 # End clausification derivation
% 1.49/0.56 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.49/0.56 cnf(i_0_14, plain, (equalish(n0,n0)=true)).
% 1.49/0.56 cnf(i_0_15, plain, (equalish(n1,n1)=true)).
% 1.49/0.56 cnf(i_0_16, plain, (ifeq(equalish(n0,n1),true,goal,true)=true)).
% 1.49/0.56 cnf(i_0_17, plain, (ifeq(equalish(n1,n0),true,goal,true)=true)).
% 1.49/0.56 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 1.49/0.56 cnf(i_0_19, plain, (ifeq(f(X1,X2,X3,X4,X5,X6),true,ifeq(f(X7,X8,X9,X10,X11,X6),true,equalish(X11,X5),true),true)=true)).
% 1.49/0.56 cnf(i_0_20, plain, (ifeq(f(X1,X2,X3,X4,X5,X6),true,ifeq(f(X7,X8,X9,X10,X11,X6),true,equalish(X10,X4),true),true)=true)).
% 1.49/0.56 cnf(i_0_21, plain, (ifeq(f(X1,X2,X3,X4,X5,X6),true,ifeq(f(X7,X8,X9,X10,X11,X6),true,equalish(X9,X3),true),true)=true)).
% 1.49/0.56 cnf(i_0_22, plain, (ifeq(f(X1,X2,X3,X4,X5,X6),true,ifeq(f(X7,X8,X9,X10,X11,X6),true,equalish(X8,X2),true),true)=true)).
% 1.49/0.56 cnf(i_0_23, plain, (ifeq(f(X1,X2,X3,X4,X5,X6),true,ifeq(f(X7,X8,X9,X10,X11,X6),true,equalish(X7,X1),true),true)=true)).
% 1.49/0.56 cnf(i_0_18, plain, (ifeq(equalish(X1,X1),true,ifeq(equalish(X2,X2),true,ifeq(equalish(X3,X3),true,ifeq(equalish(X4,X4),true,ifeq(equalish(X5,X5),true,f(X5,X4,X3,X2,X1,sK1_relation_exists_F(X5,X4,X3,X2,X1)),true),true),true),true),true)=true)).
% 1.49/0.56 cnf(i_0_24, negated_conjecture, (goal!=true)).
% 1.49/0.56 cnf(i_0_26, plain, (X12=X12)).
% 1.49/0.56 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.49/0.56 # Begin printing tableau
% 1.49/0.56 # Found 10 steps
% 1.49/0.56 cnf(i_0_14, plain, (equalish(n0,n0)=true), inference(start_rule)).
% 1.49/0.56 cnf(i_0_34, plain, (equalish(n0,n0)=true), inference(extension_rule, [i_0_32])).
% 1.49/0.56 cnf(i_0_63, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 cnf(i_0_64, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 cnf(i_0_65, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 cnf(i_0_67, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 cnf(i_0_62, plain, (sK1_relation_exists_F(equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0),equalish(n0,n0))=sK1_relation_exists_F(true,true,true,true,true)), inference(extension_rule, [i_0_30])).
% 1.49/0.56 cnf(i_0_178, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 cnf(i_0_179, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 cnf(i_0_180, plain, (equalish(n0,n0)!=true), inference(closure_rule, [i_0_14])).
% 1.49/0.56 # End printing tableau
% 1.49/0.56 # SZS output end
% 1.49/0.56 # Branches closed with saturation will be marked with an "s"
% 1.49/0.56 # 23791 Satisfiable branch
% 1.49/0.56 # 23795 Satisfiable branch
% 1.49/0.56 # Child (23798) has found a proof.
% 1.49/0.56
% 1.49/0.56 # Proof search is over...
% 1.49/0.56 # Freeing feature tree
%------------------------------------------------------------------------------