%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN563-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 : n012.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:12:29 EDT 2022 % Result : Unsatisfiable 5.71s 1.11s % Output : CNFRefutation 5.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN563-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.34 % Computer : n012.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 14:29:13 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 20 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 18 conjectures. % 0.12/0.37 # There are 18 start rule candidates: % 0.12/0.37 # Found 20 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 18 start rule tableaux created. % 0.12/0.37 # 0 extension rule candidate clauses % 0.12/0.37 # 20 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 5.18/1.03 # Creating equality axioms % 5.18/1.03 # Ran out of tableaux, making start rules for all clauses % 5.18/1.04 # Creating equality axioms % 5.18/1.04 # Ran out of tableaux, making start rules for all clauses % 5.18/1.04 # Creating equality axioms % 5.18/1.04 # Ran out of tableaux, making start rules for all clauses % 5.18/1.04 # Creating equality axioms % 5.18/1.04 # Ran out of tableaux, making start rules for all clauses % 5.18/1.05 # Creating equality axioms % 5.18/1.05 # Ran out of tableaux, making start rules for all clauses % 5.18/1.06 # Creating equality axioms % 5.18/1.06 # Ran out of tableaux, making start rules for all clauses % 5.18/1.06 # Creating equality axioms % 5.18/1.06 # Ran out of tableaux, making start rules for all clauses % 5.71/1.11 # There were 1 total branch saturation attempts. % 5.71/1.11 # There were 0 of these attempts blocked. % 5.71/1.11 # There were 0 deferred branch saturation attempts. % 5.71/1.11 # There were 0 free duplicated saturations. % 5.71/1.11 # There were 1 total successful branch saturations. % 5.71/1.11 # There were 0 successful branch saturations in interreduction. % 5.71/1.11 # There were 0 successful branch saturations on the branch. % 5.71/1.11 # There were 1 successful branch saturations after the branch. % 5.71/1.11 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.71/1.11 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.71/1.11 # Begin clausification derivation % 5.71/1.11 % 5.71/1.11 # End clausification derivation % 5.71/1.11 # Begin listing active clauses obtained from FOF to CNF conversion % 5.71/1.11 cnf(i_0_25, negated_conjecture, (p2(f4(c7),f4(c8))=true)). % 5.71/1.11 cnf(i_0_38, negated_conjecture, (ifeq(p6(f4(c7),c8),true,a,b)=b)). % 5.71/1.11 cnf(i_0_39, negated_conjecture, (ifeq(p6(f4(c7),f3(f4(c8))),true,a,b)=b)). % 5.71/1.11 cnf(i_0_23, negated_conjecture, (p2(X1,X1)=true)). % 5.71/1.11 cnf(i_0_24, negated_conjecture, (p6(X1,X1)=true)). % 5.71/1.11 cnf(i_0_27, negated_conjecture, (p5(f3(f3(X1)),f3(f4(X1)))=true)). % 5.71/1.11 cnf(i_0_21, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 5.71/1.11 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)). % 5.71/1.11 cnf(i_0_26, negated_conjecture, (ifeq2(p5(X1,X2),true,p6(X1,X2),true)=true)). % 5.71/1.11 cnf(i_0_30, negated_conjecture, (ifeq2(p5(X1,X2),true,p6(f4(X1),X2),true)=true)). % 5.71/1.11 cnf(i_0_29, negated_conjecture, (ifeq2(p6(c7,X1),true,p6(c7,f3(X1)),true)=true)). % 5.71/1.11 cnf(i_0_28, negated_conjecture, (ifeq2(p6(f4(X1),X2),true,p5(X1,X2),true)=true)). % 5.71/1.11 cnf(i_0_32, negated_conjecture, (ifeq2(p2(X1,X2),true,p2(f4(X1),f4(X2)),true)=true)). % 5.71/1.11 cnf(i_0_31, negated_conjecture, (ifeq2(p2(X1,X2),true,p2(f3(X1),f3(X2)),true)=true)). % 5.71/1.11 cnf(i_0_33, negated_conjecture, (ifeq2(p2(X1,X2),true,ifeq2(p2(X1,X3),true,p2(X3,X2),true),true)=true)). % 5.71/1.11 cnf(i_0_34, negated_conjecture, (ifeq2(p6(X1,X2),true,ifeq2(p6(X3,X1),true,p6(X3,X2),true),true)=true)). % 5.71/1.11 cnf(i_0_35, negated_conjecture, (ifeq2(p6(X1,X2),true,ifeq2(p5(X2,X3),true,p5(X1,X3),true),true)=true)). % 5.71/1.11 cnf(i_0_36, negated_conjecture, (ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p6(X3,X1),true,p6(X4,X2),true),true),true)=true)). % 5.71/1.11 cnf(i_0_37, negated_conjecture, (ifeq2(p2(X1,X2),true,ifeq2(p2(X3,X4),true,ifeq2(p5(X1,X3),true,p5(X2,X4),true),true),true)=true)). % 5.71/1.11 cnf(i_0_40, negated_conjecture, (a!=b)). % 5.71/1.11 cnf(i_0_59, plain, (X5=X5)). % 5.71/1.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.71/1.11 # Begin printing tableau % 5.71/1.11 # Found 8 steps % 5.71/1.11 cnf(i_0_59, plain, (true=true), inference(start_rule)). % 5.71/1.11 cnf(i_0_90, plain, (true=true), inference(extension_rule, [i_0_63])). % 5.71/1.11 cnf(i_0_100, plain, (p2(f4(c7),f4(c8))!=true), inference(closure_rule, [i_0_25])). % 5.71/1.11 cnf(i_0_101, plain, (p2(f4(c7),f4(c8))!=true), inference(closure_rule, [i_0_25])). % 5.71/1.11 cnf(i_0_102, plain, (p2(f4(c7),f4(c8))!=true), inference(closure_rule, [i_0_25])). % 5.71/1.11 cnf(i_0_98, plain, (ifeq2(true,p2(f4(c7),f4(c8)),p2(f4(c7),f4(c8)),p2(f4(c7),f4(c8)))=ifeq2(true,true,true,true)), inference(extension_rule, [i_0_62])). % 5.71/1.11 cnf(i_0_109, plain, (ifeq2(true,true,true,true)!=true), inference(closure_rule, [i_0_21])). % 5.71/1.11 cnf(i_0_107, plain, (ifeq2(true,p2(f4(c7),f4(c8)),p2(f4(c7),f4(c8)),p2(f4(c7),f4(c8)))=true), inference(etableau_closure_rule, [i_0_107, ...])). % 5.71/1.11 # End printing tableau % 5.71/1.11 # SZS output end % 5.71/1.11 # Branches closed with saturation will be marked with an "s" % 5.71/1.11 # Child (25026) has found a proof. % 5.71/1.11 % 5.71/1.11 # Proof search is over... % 5.71/1.11 # Freeing feature tree %------------------------------------------------------------------------------