%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ054-10 : TPTP v8.1.0. Released v7.5.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 : n027.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 : Mon Jul 18 18:11:03 EDT 2022 % Result : Satisfiable 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : PUZ054-10 : TPTP v8.1.0. Released v7.5.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n027.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun May 29 02:53:29 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 6 Number of unprocessed: 6 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 6 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 6 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 6 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 15 tableaux to operate on % 0.12/0.37 # 6029 Satisfiable branch % 0.12/0.38 # 6032 Satisfiable branch % 0.12/0.38 # 6030 Satisfiable branch % 0.12/0.38 # 6033 Satisfiable branch % 0.12/0.38 # 6034 Satisfiable branch % 0.12/0.38 # Satisfiable branch found. % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 0 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 0 successful branch saturations after the branch. % 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)=true)). % 0.12/0.38 cnf(i_0_10, plain, (ifeq(p(X1,s(s(X2))),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_9, plain, (ifeq(p(s(s(X1)),X2),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.12/0.38 cnf(i_0_8, plain, (p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0))))))))))=true)). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (p(s(n0),n0)!=true)). % 0.12/0.38 cnf(i_0_14, plain, (X4=X4)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 5 steps % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X8),s(X7)),true,p(s(X8),X7),true)=true), inference(start_rule)). % 0.12/0.38 cnf(i_0_21, plain, (ifeq(p(s(X8),s(X7)),true,p(s(X8),X7),true)=true), inference(extension_rule, [i_0_20])). % 0.12/0.38 cnf(i_0_44, plain, (ifeq(p(s(X1),s(p(true,true))),true,p(s(X1),p(true,true)),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_42, plain, (p(ifeq(p(s(X8),s(X7)),true,p(s(X8),X7),true),ifeq(p(s(X1),s(p(true,true))),true,p(s(X1),p(true,true)),true))=p(true,true)), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_51, plain, (p(true,true)!=ifeq(X1,X1,p(true,true),X3)), inference(closure_rule, [i_0_7])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Satisfiable branch found. % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 0 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 0 successful branch saturations after the branch. % 0.12/0.38 # 6031 Satisfiable branch % 0.12/0.38 # Satisfiable branch found. % 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)=true)). % 0.12/0.38 cnf(i_0_10, plain, (ifeq(p(X1,s(s(X2))),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_9, plain, (ifeq(p(s(s(X1)),X2),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.12/0.38 cnf(i_0_8, plain, (p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0))))))))))=true)). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (p(s(n0),n0)!=true)). % 0.12/0.38 cnf(i_0_14, plain, (X4=X4)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 7 steps % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X24),s(X23)),true,p(s(X24),X23),true)=true), inference(start_rule)). % 0.12/0.38 cnf(i_0_21, plain, (ifeq(p(s(X24),s(X23)),true,p(s(X24),X23),true)=true), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_36, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_37, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_39, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_35, plain, (ifeq(ifeq(p(s(true),s(true)),true,p(s(true),true),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true),ifeq(p(s(X24),s(X23)),true,p(s(X24),X23),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_51, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Satisfiable branch found. % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 0 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 0 successful branch saturations after the branch. % 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)=true)). % 0.12/0.38 cnf(i_0_10, plain, (ifeq(p(X1,s(s(X2))),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_9, plain, (ifeq(p(s(s(X1)),X2),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.12/0.38 cnf(i_0_8, plain, (p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0))))))))))=true)). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (p(s(n0),n0)!=true)). % 0.12/0.38 cnf(i_0_14, plain, (X4=X4)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 7 steps % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X22),s(X21)),true,p(s(X22),X21),true)=true), inference(start_rule)). % 0.12/0.38 cnf(i_0_21, plain, (ifeq(p(s(X22),s(X21)),true,p(s(X22),X21),true)=true), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_36, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_38, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_39, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_35, plain, (ifeq(ifeq(p(s(true),s(true)),true,p(s(true),true),true),ifeq(p(s(X22),s(X21)),true,p(s(X22),X21),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_51, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 0 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 0 successful branch saturations after the branch. % 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)=true)). % 0.12/0.38 cnf(i_0_10, plain, (ifeq(p(X1,s(s(X2))),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_9, plain, (ifeq(p(s(s(X1)),X2),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.12/0.38 cnf(i_0_8, plain, (p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0))))))))))=true)). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (p(s(n0),n0)!=true)). % 0.12/0.38 cnf(i_0_14, plain, (X4=X4)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X20),s(X19)),true,p(s(X20),X19),true)=true), inference(start_rule)). % 0.12/0.38 cnf(i_0_21, plain, (ifeq(p(s(X20),s(X19)),true,p(s(X20),X19),true)=true), inference(extension_rule, [i_0_19])). % 0.12/0.38 cnf(i_0_40, plain, (s(ifeq(p(s(X20),s(X19)),true,p(s(X20),X19),true))=s(true)), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_112, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_113, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_114, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Satisfiable branch found. % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 0 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 0 successful branch saturations after the branch. % 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X1),s(X2)),true,p(s(X1),X2),true)=true)). % 0.12/0.38 cnf(i_0_10, plain, (ifeq(p(X1,s(s(X2))),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_9, plain, (ifeq(p(s(s(X1)),X2),true,p(X1,s(X2)),true)=true)). % 0.12/0.38 cnf(i_0_7, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.12/0.38 cnf(i_0_8, plain, (p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0))))))))))=true)). % 0.12/0.38 cnf(i_0_12, negated_conjecture, (p(s(n0),n0)!=true)). % 0.12/0.38 cnf(i_0_14, plain, (X4=X4)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 7 steps % 0.12/0.38 cnf(i_0_11, plain, (ifeq(p(s(X20),s(X19)),true,p(s(X20),X19),true)=true), inference(start_rule)). % 0.12/0.38 cnf(i_0_21, plain, (ifeq(p(s(X20),s(X19)),true,p(s(X20),X19),true)=true), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_37, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_38, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_39, plain, (ifeq(p(s(true),s(true)),true,p(s(true),true),true)!=true), inference(closure_rule, [i_0_11])). % 0.12/0.38 cnf(i_0_35, plain, (ifeq(ifeq(p(s(X20),s(X19)),true,p(s(X20),X19),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true),ifeq(p(s(true),s(true)),true,p(s(true),true),true))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_17])). % 0.12/0.38 cnf(i_0_51, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_7])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (6029) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------