%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT005-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 : n024.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:24 EDT 2022 % Result : Unsatisfiable 38.09s 5.16s % Output : CNFRefutation 38.09s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : LAT005-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.13/0.32 % Computer : n024.cluster.edu % 0.13/0.32 % Model : x86_64 x86_64 % 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.32 % Memory : 8042.1875MB % 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.32 % CPULimit : 300 % 0.13/0.32 % WCLimit : 600 % 0.13/0.32 % DateTime : Wed Jun 29 03:37:00 EDT 2022 % 0.13/0.32 % CPUTime : % 0.18/0.35 # No SInE strategy applied % 0.18/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.35 # % 0.18/0.35 # Presaturation interreduction done % 0.18/0.35 # Number of axioms: 22 Number of unprocessed: 22 % 0.18/0.35 # Tableaux proof search. % 0.18/0.35 # APR header successfully linked. % 0.18/0.35 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 22 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 22 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 0 extension rule candidate clauses % 0.18/0.36 # 22 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 42 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 42 tableaux to operate on % 38.09/5.16 # There were 2 total branch saturation attempts. % 38.09/5.16 # There were 0 of these attempts blocked. % 38.09/5.16 # There were 0 deferred branch saturation attempts. % 38.09/5.16 # There were 0 free duplicated saturations. % 38.09/5.16 # There were 1 total successful branch saturations. % 38.09/5.16 # There were 0 successful branch saturations in interreduction. % 38.09/5.16 # There were 0 successful branch saturations on the branch. % 38.09/5.16 # There were 1 successful branch saturations after the branch. % 38.09/5.16 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.09/5.16 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 38.09/5.16 # Begin clausification derivation % 38.09/5.16 % 38.09/5.16 # End clausification derivation % 38.09/5.16 # Begin listing active clauses obtained from FOF to CNF conversion % 38.09/5.16 cnf(i_0_34, plain, (meet(X1,n0)=n0)). % 38.09/5.16 cnf(i_0_42, hypothesis, (complement(r1,join(a,b))=true)). % 38.09/5.16 cnf(i_0_43, hypothesis, (complement(r2,meet(a,b))=true)). % 38.09/5.16 cnf(i_0_37, plain, (join(X1,n1)=n1)). % 38.09/5.16 cnf(i_0_36, plain, (meet(X1,n1)=X1)). % 38.09/5.16 cnf(i_0_35, plain, (join(X1,n0)=X1)). % 38.09/5.16 cnf(i_0_26, plain, (meet(X1,X1)=X1)). % 38.09/5.16 cnf(i_0_27, plain, (join(X1,X1)=X1)). % 38.09/5.16 cnf(i_0_23, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 38.09/5.16 cnf(i_0_24, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 38.09/5.16 cnf(i_0_28, plain, (meet(X1,join(X1,X2))=X1)). % 38.09/5.16 cnf(i_0_29, plain, (join(X1,meet(X1,X2))=X1)). % 38.09/5.16 cnf(i_0_32, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 38.09/5.16 cnf(i_0_25, plain, (ifeq(X1,X1,X2,X3)=X2)). % 38.09/5.16 cnf(i_0_33, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 38.09/5.16 cnf(i_0_39, plain, (ifeq(complement(X1,X2),true,meet(X1,X2),n0)=n0)). % 38.09/5.16 cnf(i_0_40, plain, (ifeq(complement(X1,X2),true,join(X1,X2),n1)=n1)). % 38.09/5.16 cnf(i_0_41, plain, (ifeq2(join(X1,X2),n1,ifeq2(meet(X1,X2),n0,complement(X1,X2),true),true)=true)). % 38.09/5.16 cnf(i_0_38, plain, (ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X3,X2)))=join(X1,meet(X3,X2)))). % 38.09/5.16 cnf(i_0_30, plain, (meet(X1,X2)=meet(X2,X1))). % 38.09/5.16 cnf(i_0_31, plain, (join(X1,X2)=join(X2,X1))). % 38.09/5.16 cnf(i_0_44, negated_conjecture, (meet(join(r1,meet(a,r2)),join(r1,meet(b,r2)))!=r1)). % 38.09/5.16 cnf(i_0_46, plain, (X4=X4)). % 38.09/5.16 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 38.09/5.16 # Begin printing tableau % 38.09/5.16 # Found 12 steps % 38.09/5.16 cnf(i_0_34, plain, (meet(X12,n0)=n0), inference(start_rule)). % 38.09/5.16 cnf(i_0_56, plain, (meet(X12,n0)=n0), inference(extension_rule, [i_0_52])). % 38.09/5.16 cnf(i_0_97, plain, (meet(ifeq(n0,n0,n0,n0),n0)!=n0), inference(closure_rule, [i_0_34])). % 38.09/5.16 cnf(i_0_98, plain, (meet(ifeq(n0,n0,n0,n0),n0)!=n0), inference(closure_rule, [i_0_34])). % 38.09/5.16 cnf(i_0_100, plain, (meet(ifeq(n0,n0,n0,n0),n0)!=n0), inference(closure_rule, [i_0_34])). % 38.09/5.16 cnf(i_0_96, plain, (ifeq(meet(ifeq(n0,n0,n0,n0),n0),meet(ifeq(n0,n0,n0,n0),n0),meet(X12,n0),meet(ifeq(n0,n0,n0,n0),n0))=ifeq(n0,n0,n0,n0)), inference(extension_rule, [i_0_49])). % 38.09/5.16 cnf(i_0_116, plain, (meet(ifeq(n0,n0,n0,n0),n1)!=ifeq(n0,n0,n0,n0)), inference(closure_rule, [i_0_36])). % 38.09/5.16 cnf(i_0_114, plain, (ifeq(meet(ifeq(n0,n0,n0,n0),n0),meet(ifeq(n0,n0,n0,n0),n0),meet(X12,n0),meet(ifeq(n0,n0,n0,n0),n0))=meet(ifeq(n0,n0,n0,n0),n1)), inference(extension_rule, [i_0_50])). % 38.09/5.16 cnf(i_0_385622, plain, (meet(X1,n0)!=n0), inference(closure_rule, [i_0_34])). % 38.09/5.16 cnf(i_0_385623, plain, (meet(X1,n0)!=n0), inference(closure_rule, [i_0_34])). % 38.09/5.16 cnf(i_0_385624, plain, (meet(X1,n0)!=n0), inference(closure_rule, [i_0_34])). % 38.09/5.16 cnf(i_0_385620, plain, (ifeq3(ifeq(meet(ifeq(n0,n0,n0,n0),n0),meet(ifeq(n0,n0,n0,n0),n0),meet(X12,n0),meet(ifeq(n0,n0,n0,n0),n0)),meet(X1,n0),meet(X1,n0),meet(X1,n0))=ifeq3(meet(ifeq(n0,n0,n0,n0),n1),n0,n0,n0)), inference(etableau_closure_rule, [i_0_385620, ...])). % 38.09/5.16 # End printing tableau % 38.09/5.16 # SZS output end % 38.09/5.16 # Branches closed with saturation will be marked with an "s" % 38.09/5.18 # Child (560) has found a proof. % 38.09/5.18 % 38.09/5.18 # Proof search is over... % 38.09/5.18 # Freeing feature tree %------------------------------------------------------------------------------