%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN337-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 : n021.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 21 06:10:03 EDT 2022 % Result : Satisfiable 0.15s 0.39s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : SYN337-10 : TPTP v8.1.0. Released v7.3.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.36 % Computer : n021.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Tue Jul 12 06:52:24 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.39 # No SInE strategy applied % 0.15/0.39 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.15/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.15/0.39 # % 0.15/0.39 # Number of axioms: 7 Number of unprocessed: 7 % 0.15/0.39 # Tableaux proof search. % 0.15/0.39 # APR header successfully linked. % 0.15/0.39 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 7 beginning clauses after preprocessing and clausification % 0.15/0.39 # Creating start rules for all 6 conjectures. % 0.15/0.39 # There are 6 start rule candidates: % 0.15/0.39 # Found 7 unit axioms. % 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.39 # 6 start rule tableaux created. % 0.15/0.39 # 0 extension rule candidate clauses % 0.15/0.39 # 7 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 6 % 0.15/0.39 # Creating equality axioms % 0.15/0.39 # Ran out of tableaux, making start rules for all clauses % 0.15/0.39 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.15/0.39 # We now have 15 tableaux to operate on % 0.15/0.39 # 14028 Satisfiable branch % 0.15/0.39 # 14029 Satisfiable branch % 0.15/0.39 # 14030 Satisfiable branch % 0.15/0.39 # 14031 Satisfiable branch % 0.15/0.39 # Satisfiable branch found. % 0.15/0.39 # Satisfiable branch found. % 0.15/0.39 # There were 1 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 0 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 0 successful branch saturations after the branch. % 0.15/0.39 # There were 1 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 0 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 0 successful branch saturations after the branch. % 0.15/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_14, negated_conjecture, (a2!=b2)). % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1)=true)). % 0.15/0.39 cnf(i_0_10, negated_conjecture, (f(z(X1),a)=true)). % 0.15/0.39 cnf(i_0_11, negated_conjecture, (f(z(X1),X1)=true)). % 0.15/0.39 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.15/0.39 cnf(i_0_12, negated_conjecture, (ifeq(f(b,X1),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_13, negated_conjecture, (ifeq(f(b,z(X1)),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_21, plain, (X4=X4)). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 5 steps % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X7)=true), inference(start_rule)). % 0.15/0.39 cnf(i_0_29, plain, (f(a,X7)=true), inference(extension_rule, [i_0_26])). % 0.15/0.39 cnf(i_0_66, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_65, plain, (f(f(a,X1),f(a,X7))=f(true,true)), inference(extension_rule, [i_0_24])). % 0.15/0.39 cnf(i_0_76, plain, (f(f(a,X1),f(a,X7))!=f(true,true)), inference(closure_rule, [i_0_65])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # 14032 Satisfiable branch % 0.15/0.39 # 14033 Satisfiable branch % 0.15/0.39 # Satisfiable branch found. % 0.15/0.39 # There were 1 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 0 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 0 successful branch saturations after the branch. % 0.15/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_14, negated_conjecture, (a2!=b2)). % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1)=true)). % 0.15/0.39 cnf(i_0_10, negated_conjecture, (f(z(X1),a)=true)). % 0.15/0.39 cnf(i_0_11, negated_conjecture, (f(z(X1),X1)=true)). % 0.15/0.39 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.15/0.39 cnf(i_0_12, negated_conjecture, (ifeq(f(b,X1),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_13, negated_conjecture, (ifeq(f(b,z(X1)),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_21, plain, (X4=X4)). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 5 steps % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X6)=true), inference(start_rule)). % 0.15/0.39 cnf(i_0_29, plain, (f(a,X6)=true), inference(extension_rule, [i_0_26])). % 0.15/0.39 cnf(i_0_67, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_65, plain, (f(f(a,X6),f(a,X1))=f(true,true)), inference(extension_rule, [i_0_24])). % 0.15/0.39 cnf(i_0_76, plain, (f(f(a,X6),f(a,X1))!=f(true,true)), inference(closure_rule, [i_0_65])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_14, negated_conjecture, (a2!=b2)). % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1)=true)). % 0.15/0.39 cnf(i_0_10, negated_conjecture, (f(z(X1),a)=true)). % 0.15/0.39 cnf(i_0_11, negated_conjecture, (f(z(X1),X1)=true)). % 0.15/0.39 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.15/0.39 cnf(i_0_12, negated_conjecture, (ifeq(f(b,X1),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_13, negated_conjecture, (ifeq(f(b,z(X1)),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_21, plain, (X4=X4)). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 4 steps % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X4)=true), inference(start_rule)). % 0.15/0.39 cnf(i_0_29, plain, (f(a,X4)=true), inference(extension_rule, [i_0_27])). % 0.15/0.39 cnf(i_0_68, plain, (z(f(a,X4))=z(true)), inference(extension_rule, [i_0_24])). % 0.15/0.39 cnf(i_0_76, plain, (z(f(a,X4))!=z(true)), inference(closure_rule, [i_0_68])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # Satisfiable branch found. % 0.15/0.39 # There were 1 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 0 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 0 successful branch saturations after the branch. % 0.15/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_14, negated_conjecture, (a2!=b2)). % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1)=true)). % 0.15/0.39 cnf(i_0_10, negated_conjecture, (f(z(X1),a)=true)). % 0.15/0.39 cnf(i_0_11, negated_conjecture, (f(z(X1),X1)=true)). % 0.15/0.39 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.15/0.39 cnf(i_0_12, negated_conjecture, (ifeq(f(b,X1),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_13, negated_conjecture, (ifeq(f(b,z(X1)),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_21, plain, (X4=X4)). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 7 steps % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X21)=true), inference(start_rule)). % 0.15/0.39 cnf(i_0_29, plain, (f(a,X21)=true), inference(extension_rule, [i_0_25])). % 0.15/0.39 cnf(i_0_61, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_62, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_63, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_60, plain, (ifeq(f(a,X1),f(a,X1),f(a,X1),f(a,X21))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_24])). % 0.15/0.39 cnf(i_0_76, plain, (ifeq(f(a,X1),f(a,X1),f(a,X1),f(a,X21))!=ifeq(true,true,true,true)), inference(closure_rule, [i_0_60])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # 14034 Satisfiable branch % 0.15/0.39 # Satisfiable branch found. % 0.15/0.39 # There were 1 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 0 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 0 successful branch saturations after the branch. % 0.15/0.39 # Satisfiable branch found. % 0.15/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_14, negated_conjecture, (a2!=b2)). % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1)=true)). % 0.15/0.39 cnf(i_0_10, negated_conjecture, (f(z(X1),a)=true)). % 0.15/0.39 cnf(i_0_11, negated_conjecture, (f(z(X1),X1)=true)). % 0.15/0.39 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.15/0.39 cnf(i_0_12, negated_conjecture, (ifeq(f(b,X1),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_13, negated_conjecture, (ifeq(f(b,z(X1)),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_21, plain, (X4=X4)). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 7 steps % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X20)=true), inference(start_rule)). % 0.15/0.39 cnf(i_0_29, plain, (f(a,X20)=true), inference(extension_rule, [i_0_25])). % 0.15/0.39 cnf(i_0_61, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_62, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_64, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_60, plain, (ifeq(f(a,X1),f(a,X1),f(a,X20),f(a,X1))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_24])). % 0.15/0.39 cnf(i_0_76, plain, (ifeq(f(a,X1),f(a,X1),f(a,X20),f(a,X1))!=ifeq(true,true,true,true)), inference(closure_rule, [i_0_60])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # There were 1 total branch saturation attempts. % 0.15/0.39 # There were 0 of these attempts blocked. % 0.15/0.39 # There were 0 deferred branch saturation attempts. % 0.15/0.39 # There were 0 free duplicated saturations. % 0.15/0.39 # There were 0 total successful branch saturations. % 0.15/0.39 # There were 0 successful branch saturations in interreduction. % 0.15/0.39 # There were 0 successful branch saturations on the branch. % 0.15/0.39 # There were 0 successful branch saturations after the branch. % 0.15/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.39 # Begin clausification derivation % 0.15/0.39 % 0.15/0.39 # End clausification derivation % 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.39 cnf(i_0_14, negated_conjecture, (a2!=b2)). % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X1)=true)). % 0.15/0.39 cnf(i_0_10, negated_conjecture, (f(z(X1),a)=true)). % 0.15/0.39 cnf(i_0_11, negated_conjecture, (f(z(X1),X1)=true)). % 0.15/0.39 cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)). % 0.15/0.39 cnf(i_0_12, negated_conjecture, (ifeq(f(b,X1),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_13, negated_conjecture, (ifeq(f(b,z(X1)),true,a2,b2)=b2)). % 0.15/0.39 cnf(i_0_21, plain, (X4=X4)). % 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.39 # Begin printing tableau % 0.15/0.39 # Found 7 steps % 0.15/0.39 cnf(i_0_9, negated_conjecture, (f(a,X19)=true), inference(start_rule)). % 0.15/0.39 cnf(i_0_29, plain, (f(a,X19)=true), inference(extension_rule, [i_0_25])). % 0.15/0.39 cnf(i_0_61, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_63, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_64, plain, (f(a,X1)!=true), inference(closure_rule, [i_0_9])). % 0.15/0.39 cnf(i_0_60, plain, (ifeq(f(a,X1),f(a,X19),f(a,X1),f(a,X1))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_24])). % 0.15/0.39 cnf(i_0_76, plain, (ifeq(f(a,X1),f(a,X19),f(a,X1),f(a,X1))!=ifeq(true,true,true,true)), inference(closure_rule, [i_0_60])). % 0.15/0.39 # End printing tableau % 0.15/0.39 # SZS output end % 0.15/0.39 # Branches closed with saturation will be marked with an "s" % 0.15/0.39 # Child (14029) has found a proof. % 0.15/0.39 % 0.15/0.39 # Proof search is over... % 0.15/0.39 # Freeing feature tree %------------------------------------------------------------------------------