%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT023-1 : TPTP v8.1.0. Released v2.2.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 04:48:32 EDT 2022 % Result : Unsatisfiable 10.58s 1.69s % Output : CNFRefutation 10.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : LAT023-1 : TPTP v8.1.0. Released v2.2.0. % 0.03/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 : n026.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 : Thu Jun 30 04:03:48 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 10 Number of unprocessed: 10 % 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 # 10 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 10 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 10 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 % 10.58/1.69 # There were 1 total branch saturation attempts. % 10.58/1.69 # There were 0 of these attempts blocked. % 10.58/1.69 # There were 0 deferred branch saturation attempts. % 10.58/1.69 # There were 0 free duplicated saturations. % 10.58/1.69 # There were 1 total successful branch saturations. % 10.58/1.69 # There were 0 successful branch saturations in interreduction. % 10.58/1.69 # There were 0 successful branch saturations on the branch. % 10.58/1.69 # There were 1 successful branch saturations after the branch. % 10.58/1.69 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.58/1.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.58/1.69 # Begin clausification derivation % 10.58/1.69 % 10.58/1.69 # End clausification derivation % 10.58/1.69 # Begin listing active clauses obtained from FOF to CNF conversion % 10.58/1.69 cnf(i_0_11, plain, (meet(X1,X1)=X1)). % 10.58/1.69 cnf(i_0_12, plain, (join(X1,X1)=X1)). % 10.58/1.69 cnf(i_0_13, plain, (meet(X1,X2)=meet(X2,X1))). % 10.58/1.69 cnf(i_0_14, plain, (join(X1,X2)=join(X2,X1))). % 10.58/1.69 cnf(i_0_15, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 10.58/1.69 cnf(i_0_16, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 10.58/1.69 cnf(i_0_18, plain, (meet(join(X1,meet(X2,X3)),join(X1,X2))=join(X1,meet(X2,X3)))). % 10.58/1.69 cnf(i_0_17, plain, (join(meet(X1,join(X2,X3)),meet(X1,X2))=meet(X1,join(X2,X3)))). % 10.58/1.69 cnf(i_0_19, hypothesis, (join(meet(join(X1,X2),X3),X2)=join(meet(join(X3,X2),X1),X2))). % 10.58/1.69 cnf(i_0_20, negated_conjecture, (meet(a,join(b,meet(a,c)))!=join(meet(a,b),meet(a,c)))). % 10.58/1.69 cnf(i_0_22, plain, (X4=X4)). % 10.58/1.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.58/1.69 # Begin printing tableau % 10.58/1.69 # Found 6 steps % 10.58/1.69 cnf(i_0_14, plain, (join(meet(a,b),meet(a,c))=join(meet(a,c),meet(a,b))), inference(start_rule)). % 10.58/1.69 cnf(i_0_31, plain, (join(meet(a,b),meet(a,c))=join(meet(a,c),meet(a,b))), inference(extension_rule, [i_0_25])). % 10.58/1.69 cnf(i_0_56, plain, (meet(a,join(b,meet(a,c)))=join(meet(a,b),meet(a,c))), inference(closure_rule, [i_0_20])). % 10.58/1.69 cnf(i_0_58, plain, (join(meet(a,c),meet(a,b))!=meet(a,join(b,meet(a,c)))), inference(extension_rule, [i_0_25])). % 10.58/1.69 cnf(i_0_70, plain, (join(meet(a,c),meet(a,b))!=meet(join(meet(a,c),meet(a,b)),join(meet(a,c),meet(a,b)))), inference(closure_rule, [i_0_11])). % 10.58/1.69 cnf(i_0_71, plain, (meet(join(meet(a,c),meet(a,b)),join(meet(a,c),meet(a,b)))!=meet(a,join(b,meet(a,c)))), inference(etableau_closure_rule, [i_0_71, ...])). % 10.58/1.69 # End printing tableau % 10.58/1.69 # SZS output end % 10.58/1.69 # Branches closed with saturation will be marked with an "s" % 10.58/1.70 # Child (24466) has found a proof. % 10.58/1.70 % 10.58/1.70 # Proof search is over... % 10.58/1.70 # Freeing feature tree %------------------------------------------------------------------------------