%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT038-1 : TPTP v8.1.0. Released v2.4.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:37 EDT 2022 % Result : Unsatisfiable 0.20s 0.57s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT038-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/0.13 % 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 : n026.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 15:39:03 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 17 Number of unprocessed: 17 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 17 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 17 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 0 extension rule candidate clauses % 0.13/0.38 # 17 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 25 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 25 tableaux to operate on % 0.20/0.57 # There were 1 total branch saturation attempts. % 0.20/0.57 # There were 0 of these attempts blocked. % 0.20/0.57 # There were 0 deferred branch saturation attempts. % 0.20/0.57 # There were 0 free duplicated saturations. % 0.20/0.57 # There were 1 total successful branch saturations. % 0.20/0.57 # There were 0 successful branch saturations in interreduction. % 0.20/0.57 # There were 0 successful branch saturations on the branch. % 0.20/0.57 # There were 1 successful branch saturations after the branch. % 0.20/0.57 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.57 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.57 # Begin clausification derivation % 0.20/0.57 % 0.20/0.57 # End clausification derivation % 0.20/0.57 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.57 cnf(i_0_31, plain, (f(X1,n0)=n0)). % 0.20/0.57 cnf(i_0_29, plain, (f(n0,X1)=n0)). % 0.20/0.57 cnf(i_0_18, plain, (meet(X1,X1)=X1)). % 0.20/0.57 cnf(i_0_19, plain, (join(X1,X1)=X1)). % 0.20/0.57 cnf(i_0_20, plain, (meet(X1,join(X1,X2))=X1)). % 0.20/0.57 cnf(i_0_21, plain, (join(X1,meet(X1,X2))=X1)). % 0.20/0.57 cnf(i_0_24, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 0.20/0.57 cnf(i_0_25, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 0.20/0.57 cnf(i_0_32, hypothesis, (f(join(bb,aa),dd)=f(join(bb,cc),dd))). % 0.20/0.57 cnf(i_0_33, hypothesis, (meet(f(bb,dd),f(aa,dd))=meet(f(bb,dd),f(cc,dd)))). % 0.20/0.57 cnf(i_0_30, plain, (join(f(X1,X2),f(X1,X3))=f(X1,join(X2,X3)))). % 0.20/0.57 cnf(i_0_28, plain, (join(f(X1,X2),f(X3,X2))=f(join(X1,X3),X2))). % 0.20/0.57 cnf(i_0_27, hypothesis, (join(meet(X1,X2),meet(X1,X3))=meet(X1,join(X2,X3)))). % 0.20/0.57 cnf(i_0_26, hypothesis, (meet(join(X1,X2),join(X1,X3))=join(X1,meet(X2,X3)))). % 0.20/0.57 cnf(i_0_22, plain, (meet(X1,X2)=meet(X2,X1))). % 0.20/0.57 cnf(i_0_23, plain, (join(X1,X2)=join(X2,X1))). % 0.20/0.57 cnf(i_0_34, negated_conjecture, (f(aa,dd)!=f(cc,dd))). % 0.20/0.57 cnf(i_0_36, plain, (X4=X4)). % 0.20/0.57 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.57 # Begin printing tableau % 0.20/0.57 # Found 6 steps % 0.20/0.57 cnf(i_0_31, plain, (f(X9,n0)=n0), inference(start_rule)). % 0.20/0.57 cnf(i_0_43, plain, (f(X9,n0)=n0), inference(extension_rule, [i_0_39])). % 0.20/0.57 cnf(i_0_66, plain, (f(X9,n0)!=n0), inference(closure_rule, [i_0_31])). % 0.20/0.57 cnf(i_0_65, plain, (n0=n0), inference(extension_rule, [i_0_40])). % 0.20/0.57 cnf(i_0_136, plain, (f(X1,n0)!=n0), inference(closure_rule, [i_0_31])). % 0.20/0.57 cnf(i_0_134, plain, (meet(n0,f(X1,n0))=meet(n0,n0)), inference(etableau_closure_rule, [i_0_134, ...])). % 0.20/0.57 # End printing tableau % 0.20/0.57 # SZS output end % 0.20/0.57 # Branches closed with saturation will be marked with an "s" % 0.20/0.57 # Child (20693) has found a proof. % 0.20/0.57 % 0.20/0.57 # Proof search is over... % 0.20/0.57 # Freeing feature tree %------------------------------------------------------------------------------