%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT043-1 : TPTP v8.1.0. Released v2.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 : n015.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 04:48:39 EDT 2022 % Result : Unsatisfiable 0.19s 0.45s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT043-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/0.12 % 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 : n015.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 : Wed Jun 29 01:42:55 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 13 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 13 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 0 extension rule candidate clauses % 0.13/0.37 # 13 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 19 tableaux to operate on % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X1))=X1)). % 0.19/0.45 cnf(i_0_14, plain, (meet(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_15, plain, (join(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_17, plain, (join(X1,meet(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_24, plain, (meet(X1,complement(X1))=n0)). % 0.19/0.45 cnf(i_0_23, plain, (join(X1,complement(X1))=n1)). % 0.19/0.45 cnf(i_0_20, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.19/0.45 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_22, plain, (join(meet(X1,X2),meet(X1,X3))=meet(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_18, plain, (meet(X1,X2)=meet(X2,X1))). % 0.19/0.45 cnf(i_0_19, plain, (join(X1,X2)=join(X2,X1))). % 0.19/0.45 cnf(i_0_26, negated_conjecture, (meet(complement(c),complement(d))!=complement(join(c,d)))). % 0.19/0.45 cnf(i_0_28, plain, (X4=X4)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X5))=X5), inference(start_rule)). % 0.19/0.45 cnf(i_0_35, plain, (complement(complement(X5))=X5), inference(extension_rule, [i_0_32])). % 0.19/0.45 cnf(i_0_57, plain, (complement(complement(X3))!=X3), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_56, plain, (meet(complement(complement(X3)),complement(complement(X5)))=meet(X3,X5)), inference(extension_rule, [i_0_31])). % 0.19/0.45 cnf(i_0_70, plain, (meet(X3,X5)!=complement(complement(meet(X3,X5)))), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_68, plain, (meet(complement(complement(X3)),complement(complement(X5)))=complement(complement(meet(X3,X5)))), inference(etableau_closure_rule, [i_0_68, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X1))=X1)). % 0.19/0.45 cnf(i_0_14, plain, (meet(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_15, plain, (join(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_17, plain, (join(X1,meet(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_24, plain, (meet(X1,complement(X1))=n0)). % 0.19/0.45 cnf(i_0_23, plain, (join(X1,complement(X1))=n1)). % 0.19/0.45 cnf(i_0_20, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.19/0.45 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_22, plain, (join(meet(X1,X2),meet(X1,X3))=meet(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_18, plain, (meet(X1,X2)=meet(X2,X1))). % 0.19/0.45 cnf(i_0_19, plain, (join(X1,X2)=join(X2,X1))). % 0.19/0.45 cnf(i_0_26, negated_conjecture, (meet(complement(c),complement(d))!=complement(join(c,d)))). % 0.19/0.45 cnf(i_0_28, plain, (X4=X4)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X3))=X3), inference(start_rule)). % 0.19/0.45 cnf(i_0_35, plain, (complement(complement(X3))=X3), inference(extension_rule, [i_0_32])). % 0.19/0.45 cnf(i_0_58, plain, (complement(complement(X5))!=X5), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_56, plain, (meet(complement(complement(X3)),complement(complement(X5)))=meet(X3,X5)), inference(extension_rule, [i_0_31])). % 0.19/0.45 cnf(i_0_70, plain, (meet(X3,X5)!=complement(complement(meet(X3,X5)))), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_68, plain, (meet(complement(complement(X3)),complement(complement(X5)))=complement(complement(meet(X3,X5)))), inference(etableau_closure_rule, [i_0_68, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X1))=X1)). % 0.19/0.45 cnf(i_0_14, plain, (meet(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_15, plain, (join(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_17, plain, (join(X1,meet(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_24, plain, (meet(X1,complement(X1))=n0)). % 0.19/0.45 cnf(i_0_23, plain, (join(X1,complement(X1))=n1)). % 0.19/0.45 cnf(i_0_20, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.19/0.45 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_22, plain, (join(meet(X1,X2),meet(X1,X3))=meet(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_18, plain, (meet(X1,X2)=meet(X2,X1))). % 0.19/0.45 cnf(i_0_19, plain, (join(X1,X2)=join(X2,X1))). % 0.19/0.45 cnf(i_0_26, negated_conjecture, (meet(complement(c),complement(d))!=complement(join(c,d)))). % 0.19/0.45 cnf(i_0_28, plain, (X4=X4)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X5))=X5), inference(start_rule)). % 0.19/0.45 cnf(i_0_35, plain, (complement(complement(X5))=X5), inference(extension_rule, [i_0_33])). % 0.19/0.45 cnf(i_0_60, plain, (complement(complement(X3))!=X3), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_59, plain, (join(complement(complement(X3)),complement(complement(X5)))=join(X3,X5)), inference(extension_rule, [i_0_31])). % 0.19/0.45 cnf(i_0_70, plain, (join(X3,X5)!=complement(complement(join(X3,X5)))), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_68, plain, (join(complement(complement(X3)),complement(complement(X5)))=complement(complement(join(X3,X5)))), inference(etableau_closure_rule, [i_0_68, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X1))=X1)). % 0.19/0.45 cnf(i_0_14, plain, (meet(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_15, plain, (join(X1,X1)=X1)). % 0.19/0.45 cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_17, plain, (join(X1,meet(X1,X2))=X1)). % 0.19/0.45 cnf(i_0_24, plain, (meet(X1,complement(X1))=n0)). % 0.19/0.45 cnf(i_0_23, plain, (join(X1,complement(X1))=n1)). % 0.19/0.45 cnf(i_0_20, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.19/0.45 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_22, plain, (join(meet(X1,X2),meet(X1,X3))=meet(X1,join(X2,X3)))). % 0.19/0.45 cnf(i_0_18, plain, (meet(X1,X2)=meet(X2,X1))). % 0.19/0.45 cnf(i_0_19, plain, (join(X1,X2)=join(X2,X1))). % 0.19/0.45 cnf(i_0_26, negated_conjecture, (meet(complement(c),complement(d))!=complement(join(c,d)))). % 0.19/0.45 cnf(i_0_28, plain, (X4=X4)). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 6 steps % 0.19/0.45 cnf(i_0_25, plain, (complement(complement(X3))=X3), inference(start_rule)). % 0.19/0.45 cnf(i_0_35, plain, (complement(complement(X3))=X3), inference(extension_rule, [i_0_33])). % 0.19/0.45 cnf(i_0_61, plain, (complement(complement(X5))!=X5), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_59, plain, (join(complement(complement(X3)),complement(complement(X5)))=join(X3,X5)), inference(extension_rule, [i_0_31])). % 0.19/0.45 cnf(i_0_70, plain, (join(X3,X5)!=complement(complement(join(X3,X5)))), inference(closure_rule, [i_0_25])). % 0.19/0.45 cnf(i_0_68, plain, (join(complement(complement(X3)),complement(complement(X5)))=complement(complement(join(X3,X5)))), inference(etableau_closure_rule, [i_0_68, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # Child (18522) has found a proof. % 0.19/0.45 % 0.19/0.45 # Proof search is over... % 0.19/0.45 # Freeing feature tree %------------------------------------------------------------------------------